alemelis / bobby.jl Goto Github PK

☝️

By now, the king can move freely on any empty square or any square occupied by a piece of the opposite color. However, not all the moves are legal. Hence the king moves should be checked.

Following, tackle #2

thus, attacked squares are not only valid squares

this mixes up the perft calculation

The code is simple and readable but not extremely fast when checking all the available squares for the different pieces. Functions execution should be benchmarked for future optimisation

• PNG notation for moves IO
• FEN notation to grab position form other games

Pawns 👤

• en passant
• promotion

King 🤴

• castling

More 👀

• [ ] draw by three moves repetition
• [ ] 50 moves rule
• check #3 ( #12 )
• discovery check #2 (related to #3, involves 📌s), comes for free with #12
• checkmate

We need to implement moves generation for

non sliding pieces [useful link]

• king
• knights
• pawns

sliding pieces

• rooks
• bishops
• queen

This should be a pure performance win.

Implement discovery check logic (after #3)

http://wbec-ridderkerk.nl/html/UCIProtocol.html