Binbo - chess representation written in Erlang using Bitboards

I forgot to add a sample image (how it looks like in Erlang shell).

Here it is:

Hah, love the unicode usage. ^.^

Nice job.

I tried it and couldn’t help but try en passant (since that is usually a rule people skip in their implementation), but you got that Castling is probably also implemented?

Binbo recognizes castling when:

• White king moves from E1 to G1 ( O-O );
• White king moves from E1 to C1 ( O-O-O );
• Black king moves from E8 to G8 ( O-O );
• Black king moves from E8 to C8 ( O-O-O ).

Binbo also checks whether castling allowed or not according to the chess rules.

Threefold repetition is the only event that Binbo does not detect yet.

All the other rules (including a draw due to insufficient material) are respected.

Threefold repetition is now detected.
So, all the chess rules are completely covered.

Just to compare black and white backgrounds in terminal:

Added support for PGN loading.

To extract move list, Binbo takes into account various cases specific to PGN such as comments in braces , recursive annotation variations (RAVs) and numeric annotation glyphs (NAGs).

Nice

But I see You use regex to parse PGN.

FWIW I have written a PGN parser in leex/yecc.

https://github.com/kokolegorille/chess_parser

You are talking about parser, I’m talking about loading
So, the problem is to extract moves and make them one by one

Well, once You have extracted all the moves, You can do whatever with

I am using it to load PGN, extracts and validates moves. The parser is just a part of a bigger package…