mhalstern wrote:
Ed,
Can you answer 3 questions about Checkers:
From the database that has checkers solved:
1 - What is the longest number of moves for a forced win that can exist on the board?
I know the answer to this one, since Gil Dodgen and I solved it in 2003

The longest forced win is 253 plies, in the 7-piece database of 4 vs. 3.
You can download my paper on this result, which the ICGA Journal published:
http://www.GothicChess.com/7_piece.pdf
mhalstern wrote:
2 - How few moves from the beginning of a game are needed to produce a forced loss?
Very surprisingly, the first player to move can be in a known forced loss in 2 moves! Of course, this involves erroneous play. The checkers players called these losses "barred openings" and a list is shown here:
http://www.jimloy.com/checkers/barred.htm
I don't think this has been updated since Chinook solved checkers but most of it is probably accurate.
mhalstern wrote:
3 - The nature of chess, makes for positions that could not have happened with legal moves. Is it possible to place checkers on a board, where it would have been mathematically impossible for a legal game to have produced the position?
Sure. Just put 4 checkers in the starting position on each side of the board. You know, "fill the back rank" with checkers.
Tell me, who made the last move? Since jumps are forced, a jump could not have occurred "last move" because otherwise someone would be off the back rank.
There are countless variations of this.
Place 4 checkers in the back rank, and give the other side 1 king. Since there was no way for that king to have crowned you can see it's an illegal position. So would 1 checker + 1 king, 2 checkers + 1 king, 2 checkers + 2 kings, etc.
Conversely, and very surprisingly, it is possible for EACH SIDE to crown all 12 checkers into 12 kings, with no compulsory jumps having been made! I've replayed a game someone showed me ending with all 24 kings on the board, and now I can't find the link to it.