Think about search around the fifty-move rule

achien / chesser

chess engine written in Rust

MIT License

4 stars 0 forks source link

Think about search around the fifty-move rule #12

Open achien opened 4 years ago

achien commented 4 years ago

How do we use the transposition table around that time?
How do we cache results around that time, and is it safe to reuse or should we re-search if the halfmove clock is much lower the next time we encounter the position?

Right now the transposition table is not aware of the halfmove clock so we're almost certainly doing something non-optimal here.

achien commented 4 years ago

Oh, it is unlikely we re-search if the halfmove clock is lower because whenever the halfmove clock resets that's due to an irreversible move. So there might be some weirdness if we search some deeper lines first then search some shallower lines in the same position but I think that's unlikely to happen due to iterative deepening?