Affiliations: [a] Department of Computer Science, University of Limburg | [b] Department of Technical Mathematics and Informatics, Delft University of Technology
Note: [1] This is part 2 of a revised version of the paper delivered under the title Thoughts on the Application of Opponent-Model Search on July 2, 1993, at the 7th Conference on Advances in Computer Chess, Maastricht, The Netherlands. It will be published in full in the Proceedings of that conference.
Note: [*] At present affiliated to the Department of Computer Science, Tokyo University of Agriculture and Technology.
Abstract: An opponent is modelled by an assumed knowledge of his evaluation of positions in a game. The opponent may be fallible. Acting on one’s model of the opponent, we discuss the risks of doing so, finding a class of riskless procedures. With respect to possible gains and losses, it is shown that these may be combined into distinct strategies, four of which are exhibited and characterized by their presumed balance among them.
DOI: 10.3233/ICG-1994-17103
Journal: ICGA Journal, vol. 17, no. 1, pp. 10-14, 1994
