4 ms·
You'd have to write a Chess implementation that very carefully respects all possible game-ending pathways, a translation of a chess board into an array that a N
by brilee 9y ago
You'd have to write a Chess implementation that very carefully respects all possible game-ending pathways, a translation of a chess board into an array that a NN could understand, and a schema by which to flatten the array of all possible moves (both legal and illegal) into a single vector. Then, the MCTS and RL portions would be identical.
- jimmytucson 9y agoSounds like this meets the requirements: https://github.com/niklasf/python-chess https://github.com/niklasf/python-chess > very carefully respects all possible game-ending pathways Not sure exactly what this one means but it implements a is-game-over method, so you could do MCTS with it. > a translation of a chess board into an array that a NN could understand Chess positions are represented by sets of 64-bit integers so I don’t think this would be a blocker. > and a schema by which to flatten the array of all possible moves (both legal and illegal) into a single vector The list of legal moves is a set of bitboards as well.
- dsjoerg 9y agoNot quite. python-chess is a wonderful library, and you would use it to do the things that your parent said. But python-chess on its own doesn't do those things.