Xref: utzoo ont.events:1307 uw.talks:27 uw.cs.grad:30
Path: utzoo!attcan!utgpu!watmath!watdragon!daemon
From: daemon@watdragon.waterloo.edu (Owner of Many System Processes)
Newsgroups: ont.events,uw.talks,uw.cs.grad
Subject: ARTIFICIAL INTELLIGENCE AND DATA STRUCTURING SEMINAR
Keywords: M.V. Donskoy, Institute for Systems Studies,
Message-ID: <16594@watdragon.waterloo.edu>
Date: 22 Sep 89 16:21:10 GMT
Distribution: ont
Organization: U of Waterloo, Ontario
Lines: 35

Moscow, USSR, will 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, September 25, 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.