Xref: utzoo rec.games.programmer:3455 comp.ai:9063
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!decwrl!deccrl!bloom-beacon!eru!hagbard!sunic!mcsun!ukc!edcastle!aipdc
From: aipdc@castle.ed.ac.uk (Paul Crowley)
Newsgroups: rec.games.programmer,comp.ai
Subject: Alpha-Beta questions
Message-ID: <9625@castle.ed.ac.uk>
Date: 17 Apr 91 04:13:34 GMT
Followup-To: rec.games.programmer
Organization: Put your analyst on danger money, baby!
Lines: 22

/*----------------------------------------------*\
 | Followups redirected to rec.games.programmer |
\*----------------------------------------------*/

1) Anyone out there implemented A-B in C who'd be kind enough to throw
me source?

2) Does anyone know of any techniques for deciding how long to linger on
a given move?

3) Is it practical to build a hash table of stored evaluations under yer
average shared UNIX environment?  

4) Anyone know anything about the state-of-the-art? Is full-breadth
search still the 'in' thing, or are people looking at heuristics again?
Are there any programs which search to a non-uniform depth?

5) Is computer chess still AI, or should the discussion happen only in
rec.games.programmer (or maybe some other group again?)
                                         ____
\/ o\ Paul Crowley aipdc@uk.ac.ed.castle \  /
/\__/ Part straight. Part gay. All queer. \/