Fairy-Stockfish VS python-chess

Fairy-Stockfish supports bughouse https://github.com/fairy-stockfish/Fairy-Stockfish/releases

Try Fairy Stockfish. Not as strong as regular stockfish but still should be more than enough.

I actually already implemented it in Fairy-Stockfish, although as a separate branch: https://github.com/ianfab/Fairy-Stockfish/tree/duck. As we currently still reuse the chess evaluation until we have a first NN(UE) it isn't on top human level yet, but move ordering already is decent, so once we have a proper evaluation it should do much better.

implement your favorite Anarchy Chess rules with fairy-stockfish (https://github.com/ianfab/Fairy-Stockfish), which lichess already uses for the variants it hosts, so it should be easy™ to make your cloned lichess accept it

Oh, apparently an experimental fork of fairy-stockfish with duck chess support was published yesterday! https://github.com/ianfab/Fairy-Stockfish/tree/duck

To my knowledge it isn't. Some of the small-sized shogi variants, like Dobutsu, Micro, or Kyoto shogi, can either be (practically) weakly solved using engine search or even strongly using tablebases in the case of dobutsu shogi. However, for minishogi neither of those have yielded a definitive result yet to my knowledge. Nevertheless, deep engine searches and games from high level engines strongly indicate that gote, i.e., the second player, wins with perfect play.

You might want to take a look at - https://github.com/ianfab/Fairy-Stockfish

But, if you have a variant which the free Fairy Stockfish or ChessV (Alt link) can not play, Zillions can probably implement it fairly easily. Just this year, I created a Chess variant using an unusual tiling of squares and triangles. The only engine which can play this variant is Zillions.

If you do get around to the pi version- I highly recommend this library python-chess. It can handle valid moves in addition to querying an engine like stockfish.

There is a very good Python chess library for computing these sorts of things: https://python-chess.readthedocs.io/en/latest/ If you backed the board with this, you could do it pretty easily.

I've never done it, but it should be quite easy with python-chess to read in a detailed opening book, go through each game, and then find the last position in each game that occurs in the opening book.

pip install chess https://python-chess.readthedocs.io/en/latest/

database.lichess.org I use the python-chess package.

The tool requires this library to be installed.

python-chess

Do you need to reinvent the wheel? There's python-chess, for example: https://python-chess.readthedocs.io/en/latest/