Author: Jan K.
Date: 11:47:04 01/02/06
Hi, I have a question about KBBK endgame:let's say that you have only simple minimax searching 4-6 ply,no extensions,no selectivity,just the plain algorithm. How would you design your evaluation to be sure that the mate is found in reasonable time(<30 moves)? It seems that evaluating the most obvious factors(king distance,corner distance) is not enough here.
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.