Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!munnari.oz.au!uniwa!vax7!sschnellm
From: sschnellm@cc.curtin.edu.au
Newsgroups: comp.ai
Subject: WANTED : Papers on Search
Message-ID: <3670.26f8b0df@cc.curtin.edu.au>
Date: 20 Sep 90 04:06:55 GMT
Organization: Curtin University of Technology
Lines: 37


I have to give a 1 hr seminar on the general topic of SEARCH. What I would
like is any research articles anyone may have on the following topics
in particular :

   1. Search trees
   2. Brute-force searches  
        - breadth first,
        - depth first,
        - bidirectional, etc...
   3. Heuristic searches
        - A* search
   4. Abstraction
        - single level,
        - multiple hierachical levels
   5. Searches used in two-player games
        - Minimax,
        - Alpha-Beta pruning
        - Node orderning, etc...
   6. Real-time single agent search
        - lookahead search
        - alpha prunning
   7. Constraint satisfaction problems
        - brute force backtracking
        - intelligent backtracking
        - network-based heuristics
   8. General
        - parallel search algorithms
        - learning heuristic evaluation functions
        - any alternatives to full-width minimax searches

Any material on any of the above topics would be appreciated.
Thank you in advance.

Marcus Schnell

sschnellm@cc.curtin.edu.au