Author: Roman Hartmann
Date: 13:14:06 12/27/05
Go up one level in this thread
On December 27, 2005 at 14:01:47, Stuart Cracraft wrote: >The issue with this seems to be how you would possibly make the leap from >the program's current position to a bunch of "possible mates" without search >in order to then verify it with a mate search. > >That jump is a huge leap in A.I. and *it has not been made* - i.e. for any >given position, draw up a set of possible mate positions. > >Grandmasters can do what you describe but I don't think even Dave Wilkins >Paradise program did things like that. > >Of course, if you make a huge advance, let us know about it - I don't >think I am horribly wrong on this assessment though. > >Stuart Thanks for your comment. I'm aware that while the idea is simple to put in words isn't easy to implement into a chess engine. Maybe it's not possible at all. Just thought someone might have tried something like that before. I will keep the idea in the back of my mind an might give it a try at the right time. Roman
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.