Author: Dann Corbit
Date: 15:25:25 09/10/02
Go up one level in this thread
On September 10, 2002 at 18:13:51, Gian-Carlo Pascutto wrote: >On September 10, 2002 at 18:12:01, Dann Corbit wrote: > > >>Suppose that we perform a binary search > >I'm talking about MTD(n,f). It does *not* do that. No it does not. But it is similar. And about the same speed (within a small constant factor).
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.