Author: Robert Hyatt
Date: 05:59:40 02/11/98
Go up one level in this thread
On February 11, 1998 at 03:06:52, Bernhard Bauer wrote: >On February 10, 1998 at 08:53:20, Robert Hyatt wrote: > >>On February 10, 1998 at 06:58:59, Bernhard Bauer wrote: >> >>cute. The point, of course, is that KNN vs KB is drawn in >>99.9999999999% of >>the cases. Just that this one is wrong. But the search cuts off at >>instant >>draws to save time. I do this knowing that once I start using KNN vs KP >>this >>won't ever happen because the mate (or draw) is found before the >>Evaluate() >>procedure ever sees the position... >> >>:) >> >Does that mean that you will use KNNKP tablebases? Than it would be ok. >But now people run those positions endlessly and wonder why crafty can >not solve them. > yes. my plans include KRPKR (done), KNPKN, KNPKB, KBPKN and KBPKB, which are about 2 gigs each. Plus KNNKP to handle the one case that is a real problem... I'm trying to get a 4-processor Pentium Pro box right now. With enough disk space to make the above possible. >BTW I like crafty. >Its a good program and becomes better and better. >And its useable in a multitasking environment. >So I can run a position for hours and can do my usual work at the same >time. >If it were a DOS program I woud'nt use it at all. > >Kind regards >Bernhard
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.