Author: Robert Hyatt
Date: 09:12:36 09/26/00
Go up one level in this thread
On September 26, 2000 at 07:26:39, Georg v. Zimmermann wrote: >On September 25, 2000 at 18:43:08, José Antônio Fabiano Mendes wrote: > >>On September 25, 2000 at 18:27:03, Gian-Carlo Pascutto wrote: >> >>>On September 25, 2000 at 18:23:49, José Antônio Fabiano Mendes wrote: >>> >>>> Maybe this paper answers your question,I am not sure: >>>> Althöfer,I(1988)Günther Schrüfer: >>>> Minimax-suchen:Kosten,Qualität und Algorithmen. >>>> ICCA Journal,Vol.11,No.4 pp.160-161 >>> >>>Probably, but the problem is how to get it ;) >>> >>>I've already mailed the Technische Universitat Braunschweig >>>about it. >>> >>>Is the algorithm described in the the pages in the ICCA Journal >>>or is it just referenced? >>> >>>-- >>>GCP >> Sorry,I don´t know,maybe an ICCA subscriber could help us. > >I would be interested, too. Would be great if someone could look up whether the >algorithm is described in that article. > >Thanks, >Georg v. Zimmermann It is not. There is a 3/4 page 'review' of the thesis, but no technical details of any kind...
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.