TASVideos

Tool-assisted game movies
When human skills are just not enough

Submission #2131: Heisanevilgenius's SNES Family Feud in 03:43.0

Console: Super NES
Game name: Family Feud
Game version: USA
ROM filename: Family Feud (U).smc
Branch:
Emulator: (unknown)
Movie length: 03:43.0
FrameCount: 13380
Re-record count: 863
Author's real name: Tom White
Author's nickname: Heisanevilgenius
Submitter: Heisanevilgenius
Submitted at: 2008-11-03 22:30:45
Text last edited at: 2008-11-04 14:21:57
Text last edited by: Hyena
Download: Download (756 bytes)
Status: decision: cancelled
Submission instructions
Discuss this submission (also rating / voting)
List all submissions by this submitter
List pages on this site that refer to this submission
View submission text history
Back to the submission list
Author's comments and explanations:
This is a time-attack to complete the game Family Feud as fast as possible.

I used Snes9x v1.43+ v9.

Basic rundown:

The first bit of luck manipulation was to force the game to pick the shortest family name for my opponent. "Hall" is the shortest name, which means less time was used during the name-typing process.

After that, each round was manipulated so that the fewest number of answers were available. Round 1 has five, round 2 has five, and round 3 has four. The fewest number of answers, the less waiting there is altogether.

And finally, the most fun part, was manipulating the word recognition program. It's possible to leave out certain letters and spaces, use alternative words, and so on to trick the game into recognizing words that are much smaller, saving time in punching them.

For the fast play round, the first family member needs to have a score of 200 or more, otherwise a second family member needs to go through the same process, meaning loads of wasted time. Aside from that, it needed to be manipulated so that all the answers could be as short as possible. Since one of the answers is a number, and the others are five letters or less, this seems to be the most optimal solution.


Similar submissions (by title and categories where applicable):