Computer Chess Club Archives




Subject: Re: A story about NPS

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!!


This page took 0.04 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.