marina@ai.toronto.edu (Marina Haloulos) (09/27/89)
FLASH ANNOUNCEMENT
(SF = Sandford Fleming Building, 10 King's College Road)
-------------------------------------------------------------
ARTIFICIAL INTELLIGENCE SEMINAR
SF1105, at 4:00 p.m., Tuesday 3 October 1989
Dr. Misha V. Donskoy
Institute for Systems Studies, Moscow, USSR
"Computer Chess and Applied Problems"
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.