If you use zobrist hashing, it is probably not ridiculously slow to do this. And if your play-outs are pretty heavy anyway, the cost will be negligible as you say.
I remember John Stanback, the Zarkov chess programmer used to say that he could add anything he wanted to the evaluation function because it was so slow already. He had basically committed to heavy evaluation and it worked for him, the program was quite strong at the time. - Don On Thu, 2008-10-09 at 15:12 +0200, Magnus Persson wrote: > Valkyria does, because is superheavy anyway! A lot of weird stuff can > happen near the end of the game against programs that play randomly. I > think I implemented it because I had to to make it play correctly in > some positions. But it was a long time so I do not remember the details. > > -Magnus > > Quoting Michael Williams <[EMAIL PROTECTED]>: > > > > > While this may be true, I don't think anyone uses the superko rule in > > the playouts. It would slow them down too much and there would > > probably not be much benefit beyond the theoretical. > > > > _______________________________________________ > computer-go mailing list > computer-go@computer-go.org > http://www.computer-go.org/mailman/listinfo/computer-go/
signature.asc
Description: This is a digitally signed message part
_______________________________________________ computer-go mailing list computer-go@computer-go.org http://www.computer-go.org/mailman/listinfo/computer-go/
