4 ms·
An interesting analog to this is finding the/a sequence of moves leading from the standard starting to a given chess position, this is called https://en.wikiped
by 7373737373 2y ago
An interesting analog to this is finding the/a sequence of moves leading from the standard starting to a given chess position, this is called https://en.wikipedia.org/wiki/Proof_game https://en.wikipedia.org/wiki/Proof_game
There are a number of programs that can assist in attempting to find such a sequence, but it is far from being an easy or solved problem https://chess.stackexchange.com/questions/33328/given-a-legal-chess-position-is-there-an-algorithm-that-generates-a-series-of-m https://chess.stackexchange.com/questions/33328/given-a-lega...
In fact, this is a problem I'd love to see AI companies tackle, especially since it is somewhat related to automated theorem proving.
- tromp 2y agoPeter Österlund wrote the texelutil legality (dis)proving engine that was used in my ChessPositionRanking project [2] to accurately estimate the number of legal chess positions, by analyzing 94903 randomly generated positions that might or might not be legal. [1] https://github.com/peterosterlund2/texel https://github.com/peterosterlund2/texel [2] https://github.com/tromp/ChessPositionRanking https://github.com/tromp/ChessPositionRanking