Author: Dann Corbit
Date: 15:50:38 07/17/00
Go up one level in this thread
On July 17, 2000 at 18:38:47, Jason Williamson wrote: >On July 17, 2000 at 18:23:10, Tom Kerrigan wrote: > >>On July 17, 2000 at 17:42:35, Dann Corbit wrote: >> >>>On July 17, 2000 at 17:25:09, Tom Kerrigan wrote: >>>[snip] >>>>The point is that TSCP loses games due to 3-rep draws. >>> >>>Can't lose more than half a point through that defect. >>>;-) >>> >>>>If 3-rep draws are not detected during search, what will keep it from losing >>>>these games? >>> >>>You could make an icky hack that hardwires an eval of 0.00 to any position >>>already played twice. >>> >>>Hash, if you must. It will give TSCP a monster boost, anyway. Probably bump it >>>up another category. >>> >>>Suggestion: >>>TICP: >>>Tom's Intermediate Chess Program. >>> >>>Then all the objections vanish. >>>;-) >> >>Happily John Stanback has saved the day with a small, unobtrusive function that >>counts the number of repetitions of the current position. Expect to find it in >>the next version of TSCP. :) >> >>-Tom > > >You are gonna have to rename it soon: TNSCP.... :) (Tom's not so simple chess >program). Even with the ten line addition, you can print the whole program on fanfold and read the whole thing at once. To squeeze 2000 ELO from such a tiny package is nothing short of a miracle. There are programs with ten times as much code that get the stuffings pounded out of them.
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.