updated README

This commit is contained in:
2024-09-25 21:34:38 +02:00
parent 6ccd2a4efe
commit 924e7d5eed

View File

@ -69,5 +69,12 @@ Alpha-Beta is based on [minimax](https://en.wikipedia.org/wiki/Minimax) with an
added upper and lower bound for the position score with makes it much faster
than minimax.
The evaluation is currently simple because the only keeps track of the material
and checkmate. Here is currently the most room for optimizations.
The engine has a partly implemented UCI interface with its code in `src/uci.c`.
To detect repetitions we need a way to easily lookup, if the position already accrued. This done by
calculating a [Zobrist Hash](https://www.chessprogramming.org/Zobrist_Hashing) for the board
position. Zobrist Hashing is really nice because it allows incremental updating. With this hash the
engine has implemented its own hash tables, which allow for detecting repetitions. Later on this can
also be used for a [transposition table](https://www.chessprogramming.org/Transposition_Table).
The evaluation is currently simple. Here is currently the most room for optimizations.