ARTIFICIAL INTELLIGENCE 243 Forthcoming Papers Generalization of Alpha-Beta and SSS* Search Procedures, T. lberaki (Toyohashi, Japan) Search procedures, such as alpha-beta and SSS*, are used to soh,e minimax game trees. ~tlz a notable exception of B*, most of these procedures assume the static model i.e.. the computation is done solely on the basis of static values given to terminal nodes. The ]irst goal o/this paper is to generalize these to the informed model which permits the usage of heuristic information pertaining to nonterminal nodes, such as upper and lower bounds, and estiatates, of the exact values realizable from the corresponding game positions. We provide a general framework, within which various conventional procedures including alpha-beta and SSS* can be naturally generalized to the informed model. For the static model it is known that SSS* surpasses alpha-beta in the sense that it exph~res only a subset of the nodes which are explored by alpha-beta. The second goal of this paper is, assuming the informed model to develop a precise characterization of the class of search procedures that surpass alpha-beta. It turns out that the class contains many search procedures other than SSS* (even for the static model). Finally some computational comparison among these search procedures is made by solving the 4 x 4 Othello game. A Syntactic Theory of Belief and Action, A.R. Haas (Cambridge, MA) I/we assume that beliefs are sentences of first-order logic stored in an agent's head. we can build a simple and intuitively clear formalism /or reasoning about beliefs. I apply this formalism to the standard logical problems about belief, and use it to describe the connections between belief and planning. Shading into Texture, A.P. Pentland (Menlo Park, CA) Qualitative Simulation, B. Kuipers (Austin, TX) Artificial Intelligence 28 (1986) 243 0004-3702/86/$3.50 © 1986, Elsevier Science Publishers B,C. (North-Holland)

Forthcoming papers École Polytechnique de Montréal, Montréal, Canada

Download PDF Report

View
213
Download
1

Embed Size (px)

Citation preview

ARTIFICIAL INTELLIGENCE 243

Forthcoming Papers

G e n e r a l i z a t i o n o f A l p h a - B e t a a n d S S S * S e a r c h P r o c e d u r e s , T. lberaki (Toyohashi , Japan)

Search procedures, such as alpha-beta and SSS*, are used to soh,e minimax game trees. ~ t l z a notable exception of B*, most of these procedures assume the static model i.e.. the computation is done solely on the basis of static values given to terminal nodes. The ]irst goal o / th is paper is to generalize these to the informed model which permits the usage of heuristic information pertaining to nonterminal nodes, such as upper and lower bounds, and estiatates, of the exact values realizable from the corresponding game positions. We provide a general framework, within which various conventional procedures including alpha-beta and SSS* can be naturally generalized to the informed model.

For the static model it is known that SSS* surpasses alpha-beta in the sense that it exph~res only a subset of the nodes which are explored by alpha-beta. The second goal of this paper is, assuming the informed model to develop a precise characterization of the class of search procedures that surpass alpha-beta. It turns out that the class contains many search procedures other than SSS* (even for the static model). Finally some computational comparison among these search procedures is made by solving the 4 x 4 Othello game.

A S y n t a c t i c T h e o r y o f B e l i e f a n d A c t i o n , A.R. Haas (Cambridge, MA)

I / w e assume that beliefs are sentences of first-order logic stored in an agent's head. we can build a simple and intuitively clear formalism /or reasoning about beliefs. I apply this formalism to the standard logical problems about belief, and use it to describe the connections between belief and planning.

S h a d i n g in to T e x t u r e , A.P. Pentland (Menlo Park, CA)

Qual i t a t i ve S i m u l a t i o n , B. Kuipers (Austin, TX)