3 ms·
I think it may be possible to automate finding what I would call proof game kernels, which is just the subsequence of pawn moves (including promotions) and pawn
by tromp 5y ago
I think it may be possible to automate finding what I would call proof game kernels, which is just the subsequence of pawn moves (including promotions) and pawn captures.
One could further simplify the search by abstracting away from the exact location of pawns, but recording only their color and order within each file.
Many of the 381 illegal positions can be proven illegal just by absence of such proof kernels.
Proof game kernels can also guide construction of full proof games.
- tromp 5y agoPeter Österlund just outlined his tools and methodology for constructing proof games, which use similar ideas, at http://talkchess.com/forum3/viewtopic.php?f=7&t=77685&p=905179&sid=ae1ea68a19780eaffe3cc12b0a0ad29d#p905179 http://talkchess.com/forum3/viewtopic.php?f=7&t=77685&p=9051...