Author: Bas Hamstra
Date: 16:33:21 09/19/99
Go up one level in this thread
I just read this: [Bob Hyatt] "Remember that KD's program apparently isn't based on a traditional iterated alpha/beta search as we know it. He seems to be trying something more selective, and maybe more of a best-first search rather than a traditional depth-first search..." and became a bit curious. I wonder if you could tell a bit more of what you are doing and how it works out. Or is secret stuff? Anyway I'm interested... Regards, Bas Hamstra. On September 19, 1999 at 03:30:45, KarinsDad wrote: >On September 18, 1999 at 02:40:26, Will Singleton wrote: > >[snip] >> >>Are you attempting to pull my leg, KD? (Now on third drink.) >> >>Will > >No, I wouldn't do that. I didn't know this would sound so unrealistic. I will >try it though, and let you know the differential. > >KarinsDad :)
This page took 0.01 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.