daemon@watdragon.waterloo.edu (Owner of Many System Processes) (09/25/89)
speak on ``Computer Chess and Applied Problems.''
From: wlrush@poppy.waterloo.edu (Wenchantress Wench Wendall)
Path: poppy!wlrush
DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES
ARTIFICIAL INTELLIGENCE AND DATA STRUCTURING SEMINAR
-Monday, October 2, 1989
M.V. Donskoy, Institute for Systems Studies, Moscow,
USSR, will speak on ``Computer Chess and Applied
Problems.''
TIME: 3:30 p.m.
ROOM: DC 1304
ABSTRACT
When one looks for the solution of an applied problem,
he usually uses hierarchical search. How to carry out
this search is very important for several reasons.
This problem is well known in the literature on
Branch-and-Bound Method. In the talk, the connection
between the BB and the Alpha-Beta Method for Computer
Chess will be discussed and the possibility of
different search reduction methods will be shown. With
this goal in mind the exact posing of a search
reduction problem will be given. Some other
possibilities to utilize Computer Chess methods will be
discussed.
September 22, 1989