From 924e7d5eed26a8dfa2121305aa6b4681ab3c0f7d Mon Sep 17 00:00:00 2001 From: MrGeorgen Date: Wed, 25 Sep 2024 21:34:38 +0200 Subject: [PATCH] updated README --- README.md | 11 +++++++++-- 1 file changed, 9 insertions(+), 2 deletions(-) diff --git a/README.md b/README.md index a421e06..e9f3130 100644 --- a/README.md +++ b/README.md @@ -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.