Author: Landon Rabern
Date: 15:38:49 12/31/99
I just changed my search to remove checks on the next recursive level if the king was captured instead of running a check procedure inside the search. How do I remove checks at the leaves if I don't generate captures there? It could happen that at the depth right before the last depth that a move caused a check, but on the leaf node it would not catch it because no moves are generated, just the eval is returned. This version of my program is a complete rewrite from the one I did last year in pascal for my high school senior programming project. I have not implemented the q-search yet, will this fix the problem? Since the q-search is already imperfect it won't really matter much if I get that problem at the last depth of it, will it? I am getting around 180,000 nodes per second. Is that slow of fast or somewhere in between? Thanks in advance, Landon W. Rabern
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.