Tech report available, ftp, on game-tree evaluation

Article View: comp.doc.techreports

Article #97

Back to comp.doc.techreports Previous Next

#97

From: Raphael Finkel
Date: Wed, 30 Sep 1992 15:28

18 lines
1315 bytes

Technical report 214-92 from University of Kentucky CS department is
available by anonymous FTP.

Abstract:
	This paper defines several serial and parallel game-tree search
	methods and compares them by experiment.  The algorithms are
	alpha-beta, mandatory work first, principal-variation
	splitting, tree splitting, ER, and delay splitting.  All have
	been implemented in a common environment provided by the DIB
	package.

To access:
	ftp anon to ftp.ms.uky.edu.  Get pub/tech-reports/UK/cs/214-02.ps.Z


===========================================================================
Co-moderator:  Richard Golding, Computer & Information Sciences, UC Santa Cruz
	    compdoc-techreports-request@ftp.cse.ucsc.edu

Technical Details

Message-ID: <1ackloINNgh3@darkstar.UCSC.EDU>

Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!agate!darkstar.UCSC.EDU!golding

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!stanford.edu!agate!darkstar.UCSC.EDU!golding
From: Raphael Finkel <raphael@ms.uky.edu>
Newsgroups: comp.doc.techreports
Subject: Tech report available, ftp, on game-tree evaluation
Date: Wed, 30 Sep 1992 11:28:47 EDT
Organization: University Of Kentucky, Dept. of Math Sciences
Lines: 20
Approved: compdoc-techreports@ftp.cse.ucsc.edu
Message-ID: <1ackloINNgh3@darkstar.UCSC.EDU>
NNTP-Posting-Host: oak.ucsc.edu
Summary: Tech 214-92 from U Kentucky CS dept avail by anon ftp
Keywords: game trees, heuristic search, alpha-beta
Originator: golding@oak