Author: Landon Rabern
Date: 13:40:23 07/18/00
Go up one level in this thread
On July 17, 2000 at 18:25:27, Dann Corbit wrote: >On July 17, 2000 at 18:15:14, Jesus de la Villa wrote: > >>On July 17, 2000 at 13:40:28, Tom Kerrigan wrote: >> >>>I've had a number of requests to implement 3-fold repetition detection in TSCP. >>>It's also clear that TSCP would do better in tournaments (although that isn't >>>the goal...) if it could detect these draws. >>> >>>So the question is, is there an easy way to do the detection? >>> >>>In my "strong" program, I just compare hash keys. But TSCP doesn't keep hash >>>keys and I have no intention for it to do so. So is there another way to do it? >>> >>>Thanks in advance. >>> >>>-Tom >> >>It would be more funny if you put a random factor to return the played move, >>this is with the intention to avoid deterministic play. > >You pretty much have to have an opening book to introduce randomness. If you >just fuzz the eval with random noise, nothing good can come from it. That's >because Alpha-Beta is only going to give you one good move -- you don't know any >of the alternatives. > >If you have an opening book, you can *know* that several alternatives are pretty >good and that (perhaps) 2-3 of them are all very playable. Hence, you can >weight them and introduce randomness. But without an opening book, it will only >generate more losses. > >Or am I wrong. Does anyone really use randomness once you are out of book? At my root move I play hash-move, captures and then with then score the rest of the moves, then these moves are randomly shuffled around in the list and then sorted, so that moves with the same score are in a different order everytime. This works well to randomize play. Landon
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.