Continued working on my chess bot. It can solve simple tactics via a very simple piece-value based evaluation strategy.

Next up:

* Quiescence search: Solution to "what happens if the searching algorithm stops right before I am checkmated?"

* Time-based incremental search: Currently the depth must be given as an argument, and only one search is performed. Incremental search starts with depth 1, then goes to depth 2 with the information learned from the depth 1 search, and so on, until we are out of time.

For the curious: This is the position. White to move and win material.

FEN: r3k2r/pp3p1p/4pp2/2qN4/8/8/PPP2bPP/R2QRK2 w kq - 2 16

Sign in to participate in the conversation

The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!