Author: Robert Hyatt
Date: 14:46:59 01/02/06
Go up one level in this thread
On January 02, 2006 at 14:47:04, Jan K. wrote: >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. 1. losing king has to be driven to edge of the board. 2. losing king then has to be driven to a corner. 3. winning king also has to get close by to cut off the last escape from the two bishops checking. Same basic idea for KBN vs K which is also easy to evaluate, except now you have to recognize the "right" and "wrong" corners and drive the losing king to the right one.
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.