Author: Vasik Rajlich
Date: 03:40:01 11/30/04
Go up one level in this thread
On November 29, 2004 at 11:50:20, martin fierz wrote: >On November 29, 2004 at 08:16:35, Anthony Cozzie wrote: > >>You know, I've seen enough test positions that if someone shows me one I can do >>just about the same thing. If someone shows me a position and says "find the >>winning move", all I have to do is look at reasonable checks, captures, and >>moves to threatened squares :) But in a real game, when you don't know if there >>is a winning move, things are a lot harder. > >right. what daniel really should have said is that the correct move was his >candidate move instantly. but to really calculate the lines, you need some time >as a human... > >cheers > martin It's called non-check pruning -- a very selective search algorithm, performs quite well on some testsuites. Vas > >> >>This just gave me an idea. I should have a "test suite" mode, where it only >>looks at idiot moves in the root position :) >> >>anthony
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.