Author: Joshua Haglund
Date: 13:19:20 03/02/04
Go up one level in this thread
On March 02, 2004 at 08:01:18, Sergei S. Markoff wrote: >Hi! > >>An idea I have played with, and which worked somehow in the 16 bits version of >>Chess Tiger is to: > >I'm using in SmarThink a scheme like you described but with some differences. >I'm searching some first moves, captures and extended moves to full depth. Other >moves I'm searching with reduced depth (the reducing amount depends of several >factors, for example if the opponent king safety is worse and it's move that >going piece closer to opponent's king the reducing amount will be less e.t.c., >I'm using here a lot of knowledge including trajectories analysis e.t.c.). If >the reduced search returns value > alpha, I'm researching this move to full >depth. There are a lot of possibilities to unclude a lot of knowledge here to >build really knowledge-guided tree. I totally Agree with you! Thanks for your reply, Joshua Haglund
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.