A learning program which plays partnership dominoes

Authors:
Michael H. Smith
Affiliations:
Univ. of California, Berkeley
Venue:
Communications of the ACM
Year:
1973

Citing 2
Cited 3

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence

A method for adaptive performance improvement of operating systems

SIGMETRICS '81 Proceedings of the 1981 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Design of a low cost, general purpose robot

IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
Modeling and designing of machine learning procedures as applied to game playing using artificial intelligence

ACAI '11 Proceedings of the International Conference on Advances in Computing and Artificial Intelligence

Quantified Score

Hi-index	48.22

Visualization

Abstract

A learning program has been written in BASIC to play four-player partnership dominoes. Because dominoes is a game of incomplete information, the program uses somewhat different principles of artificial intelligence from those used in programs for games of complete information, such as checkers, chess, and go. The program was constructed to use a “strategy signature table” which classifies board situations through the interactions of game parameters. Each entry in the table contains adaptively determined weights indicating the advisability of various strategies. Once chosen, a strategy then employs probability analysis and linear polynomial evaluation to choose a move. Our program wins approximately two-thirds of its games in tournament situations, and has defeated championship players.