I am wanting to write a chess engine (see here: Creating chess engine, machine learning vs. traditional engine?). The first step I am doing is taking a position in as an FEN and converting this position into an ideal move. Pseudocode would look something like this:
Position → Move
or using notation:
rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1 → e4
I am trying to create an enumeration of every possible chess move, and I feel that I may be missing some. This includes moves like "e4", "Nxf5", "Bg3+", "Qxh4#", "exf8N#". My total count of unique moves that can be expressed using algebraic notation is 1884. Can anybody confirm the total number of unique moves that can be expressed using algebraic notation? My full list of moves can be found here: https://pastebin.com/xDNqbFt2
cxd6
I believe.