Note: The temp encode plays the run without loads first so the game as a whole is easier to digest. After, the run plays again with loads included.
Objectives
  • Uses hardest difficulty
  • Genre: Board
About this version of Checkers
This game uses official checkers rules which, most notably, means that jumping is always madatory: if a player has the option to jump, he/she must take it, even if doing so results in a disadvantage for the jumping player.
Umm... white always moves first though?? That's not the official rule but ok.
Difficulty Choice
Game 3 (expert) is the hardest difficulty and was chosen here. At Game 3, the manual claims the computer will take 2-4 minutes per move, with an entire game lasting 2+ hours. Here are the stats on the computer's thinking time during this run:
  • Average: 33.92 seconds
  • Maximum: 2 minutes, 3.20 seconds
  • Minimum: 0.22 seconds
Routing
Routing a game like this where the main thing to optimize is the computer thinking time is particularly difficult, as the "best" move is seldom the one that'll save you the most time. Lots of trial and error will be required. There are two good rules to follow in general however, which are:
  • Don't make the position complicated. More complicated positions and more move options greatly increase AI thinking time.
  • End the game in the least moves possible that does not complicate positioning. In the case of checkers, that would be done by either trading many pieces as early as possible, or trapping an opponent's pieces.
Well, trading a whole bunch of pieces early turns out to not work in our favor. Once all the front and most of the second-row pieces are traded, the AI begins to think for a VERY long time as the large separation between the two opponents' pieces means suddenly there's an extraordinary number of outcomes to consider.
In this TAS, we used a trapping strategy. What's effective about this is you're progressively reducing the complexity of the position as AI pieces become trapped (options to calculate for them are basically nil) and the player's dominance of the board becomes stronger. It will also ultimately reduce the total number of moves played in the game. The main thing to watch out for will be to not let the AI undermine your trap from the other side!
RNG
There is some randomness to computer moves when more than one move is found to be about the best. During the making of this run, I completed this very movie first without any luck manipulation. I then went back to see if I could manipulate the AI to make worse moves—or equal moves without as much thinking time. I did not come up with any better results so this movie is without luck manipulation.
Game Summary
MoveWhiteRed Load TimeCommentary
1 22-18 11-161:02.20 Old Faithful opening. Out of all the opening moves, black thinks for the least amount of time
2 18-14 10-170:00.36 Getting rid of some nuisance red pieces that would mess up our trap later
3 21-14 9-18 0:03.19 Forced captures also usually means short thinking times for red
4 23-14 8-11 1:09.22 In the end, white has control of the center and now we can go for our trap
5 26-22 16-201:43.53 Many options here. This move forces red to not think as much and traps a checker on the right
6 22-18 6-9 1:23.01 Part of the trap complete... looks like red is trying to go around the left side...
7 25-22 9-13 2:03.20 Let's make sure red doesn't try to slip by.
8 30-26 11-160:59.01 Many options here. This move forces red to not think as much and clump checkers on the right
9 26-23 7-11 1:06.35 A diagonal of 5 white checkers; now we can move in front of these without getting jumped over
10 24-19 1-6 1:12.13 Time to get moving along the diagonal highway!
11 19-15 3-8 0:27.07 Key losing move for red. Now if our planned trap unfolds, red will have 5 trapped checkers!
12 28-24 6-9 0:14.54 Our trap will be set with the next move. Time to focus on the left side of the board
13 24-19 2-6 0:05.69 If red moves 6-10 next, that would be bad for our setup so white's next move prevents that
14 14-10 9-14 0:03.55 Because of this move, we can jump to 10-1 next instead of 18-9 and trashing our good setup
15 10-1 14-170:09.93 Red moves away from one of the checkers holding our trap together. Great!
16 1-6 17-260:00.63 Let's get our king piece into the action. Mutual capturing follows
17 31-22 13-170:03.87 From this point on, red has to make obviously terrible forced moves
18 22-13 20-240:02.67 Red finally decides to make a break for it on the right but there will be no chance of that!
19 27-20 5-9 0:01.64 Red being a nuisance. Can't avoid my own pieces being in the way without messing up the trap
20 6-10 9-14 0:00.32 Luckily, the king piece can get there just in time to stop our trap from being undone
21 10-17 0:00.22 A 10-5 win on "expert"!
Suggested Screenshot: Any frame after the game is won which shows all five trapped red checkers.

feos: Claiming for judging.
feos: The fact that gameplay completely disappears while the CPU is making up its mind is insulting (and illegal in some countries).
I was unable to find any speedrun footage of this game (even TwinGalaxies features a completely different game under this name), so this run has to be judged by its own merits, and I think the audience in the thread is correct about them: minimizing CPU thinking time while still beating the game on hardest difficulty is quite an optimization challenge.
The game doesn't have an explicit ending, but it does end after you beat the CPU, so we're good. Accepting.

despoa: Processing...

nymx: Changing the branch name to have clarity for its description, which is set to be obsoleted by an improved movie. Additionally, an any% type category (Mode 1) will also co-exist with the renaming of this branch.


TASVideoAgent
They/Them
Moderator
Joined: 8/3/2004
Posts: 15629
Location: 127.0.0.1
This topic is for the purpose of discussing #7672: Winslinator's A2600 Checkers "Game 3" in 12:56.13
Joined: 7/7/2017
Posts: 28
so the computer (if you can call a 2600 a "computer") blanks the screen and thinks for up to 2 minutes between moves?? wow that's terrible.
Chamale
He/Him
Player (182)
Joined: 10/20/2006
Posts: 1355
Location: Canada
jeff_town wrote:
so the computer (if you can call a 2600 a "computer") blanks the screen and thinks for up to 2 minutes between moves?? wow that's terrible.
There was even a chess game on the 2600, which took 12 minutes to move on the second-highest difficulty and 10 hours on the highest. I voted yes on this movie. I think it makes an interesting challenge to see how quickly you can play a game against such a primitive processor, when limiting its thinking time is one of the biggest obstacles.
Personman
Other
Joined: 4/20/2008
Posts: 465
Optimizing for reducing engine computation time is a fascinating and underexplored facet of TASing, strong yes vote. Would be really cool to someday see an improvement (or work on a similar game) that relies on fully decompiling and analyzing the algorithm to take advantage of whatever pruning strategies it has.
A warb degombs the brangy. Your gitch zanks and leils the warb.
Post subject: Movie published
TASVideoAgent
They/Them
Moderator
Joined: 8/3/2004
Posts: 15629
Location: 127.0.0.1
This movie has been published. The posts before this message apply to the submission, and posts after this message apply to the published movie. ---- [4858] A2600 Checkers "Game 3" by Winslinator in 12:56.13