3 Commits (176fdd42d161036293e637bfd2c916557fb77a79)

Author	SHA1	Message	Date
Dany Thach	00f371b913	Prioritize computing nodes with few children, prioritize takes, move 1 second earlier to avoid exceeding the move time	2025-02-27 22:42:04 +01:00
Dany Thach	0469760f30	Moved the base priority calculation to the BestMoveSearcher class	2025-02-16 13:42:30 +01:00
Dany Thach	0b88775b0c	Basic move searcher, priority only based on depth (resulting in BFS), position base value takes into account isolated pawns, doubled pawns and bishop pairs	2025-02-13 22:15:59 +01:00