Author: Jouni Uski
Date: 02:19:15 06/09/98
Go up one level in this thread
On June 09, 1998 at 04:47:18, Ernst A. Heinz wrote: >On June 09, 1998 at 04:11:18, Jouni Uski wrote: > >>According to CSS magazine 2/98 Ulf Lorenz program P.Conners works >>without alfa-beta search and is still good (tactically very good). >>And it doesn't need any hash tables! > >"P.Conners" is based on "parallel controlled conspiracy number search" >(PCCNS) which needs *much* more memory than any standard alpha-beta with >transposition tables because it keeps the whole search tree in RAM ... > >As for tactical power, any decent program running on 40x P-II 266MHz >should not be too weak in this respect, should it? > >=Ernst= Thanks for info. CSS story was a little misleading and incorrect so I got there wrong info.
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.