Author: Volker Böhm
Date: 06:07:38 06/08/04
Go up one level in this thread
Hi, it is not easy to compare nodes. From verry simple q-search with only "good" captures (usually tested by SEE) to large q-search with checks, check-evades, ... The node-count differs much. On the other hand to reduce nodes: 1. Move-Ordering (Hash-Move, "good" captures, killers, "bad" captures, history, castle-moves, ...) 2. Eval-optimizing. Most improvements to eval will reduce nodes. 3. Initial Search-Window, PVS, IID, good Hash, ... Some tipps: 1. Make sure, that PV is stored in hash, thus used first. 2. Prune captures that can´t reach alpha in q-search. 3. Do not store new move as hash-move if val <= alpha. Do store old hash move if you have one and you have no new one (example val <= alpha). 4. Use SEE or a simpler approach to sort captures Greetings Volker
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.