Newsgroups: rec.games.chess,rec.games.go,comp.ai
Path: cantaloupe.srv.cs.cmu.edu!das-news.harvard.edu!news2.near.net!MathWorks.Com!europa.eng.gtefsd.com!howland.reston.ans.net!agate!msuinfo!harbinger.cc.monash.edu.au!bruce.cs.monash.edu.au!dld
From: dld@cs.monash.edu.au (David L Dowe)
Subject: Modelling of chess and go search strategies
Message-ID: <dld.779957468@bruce.cs.monash.edu.au>
Summary: Seeking info on modelling of search strategies
Keywords: search,prune,alpha-beta,strategy,games,chess,go,computer
Sender: news@bruce.cs.monash.edu.au (USENET News System)
Organization: Computer Science, Monash University, Australia
Date: Mon, 19 Sep 1994 06:51:08 GMT
Lines: 16

   In computer chess, much work has been done on refining evaluation
functions.  I am less knowledgeable about Computer Go, but this
posting pertains to computer chess, computer go and other games.

After carrying out a search, a chess player nominally applies an
evaluation function and then uses the search and the evaluations to choose
a move.  There is much time and memory to be gained by trimming searches,
and human chess players certainly do this.  I would be interested in
references to works on seacrh strategies (and ways of trimming the
search tree).

I would prefer it if replies could please be directed to me, the poster,
David Dowe, dld@cs.monash.edu.au .     If there is sufficient interest,
I could post a summary.

Regards and Thanks.        - David D.
