Author: Severi Salminen
Date: 09:51:31 01/26/01
Go up one level in this thread
>If you "advance" to a pure minmax search, you'll again get a higher nps. I don't think so because you'd have to generate all the moves in every node. But, hey, I have an idea! A minimax search algorith which would produce only one random move at every node! That would be _really_ fast!! Severi
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.