Admissibility in Opponent-Model Search

H.H.L.M. Donkers*, J.W.H.M. Uiterwijk, H.J. van den Herik

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


A thorough analysis of OM search reveals an important deficiency that has not been detected so far. It turns out that applying OM search is danerous when the own evaluation function is not perfect, in particular when it overestimates the value of a position that the opponent does not overestimate. Such a position then acts as an attractor to which both players will be guided. As a solution we define the concept of admissible pairs of evaluation functions. Only then OM search may be applied. A general discussion on risk management provides other practical solutions.
Original languageEnglish
Title of host publicationProceedings JCIS 2002
EditorsP.P. Wang
PublisherAssociation for Intelligent Machinery, Inc.
Publication statusPublished - 1 Jan 2002
Eventconference; 2002-01-01; 2002-01-01 -
Duration: 1 Jan 20021 Jan 2002


Conferenceconference; 2002-01-01; 2002-01-01


Dive into the research topics of 'Admissibility in Opponent-Model Search'. Together they form a unique fingerprint.

Cite this