Thumbnail
Access Restriction
Subscribed

Author Slagle, James R. ♦ Dixon, John K.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Kalah ♦ Min-max backing-up procedure ♦ Tree searching ♦ Decision theory ♦ Backing-up procedures ♦ Game playing ♦ Heuristic program ♦ Artificial intelligence ♦ Lisp
Abstract The M & N procedure is an improvement to the mini-max backing-up procedure widely used in computer programs for game-playing and other purposes. It is based on the principle that it is desirable to have many options when making decisions in the face of uncertainty. The mini-max procedure assigns to a MAX (MIN) node the value of the highest (lowest) valued successor to that node. The M & N procedure assigns to a MAX (MIN) node some function of the M (N) highest (lowest) valued successors. An M & N procedure was written in LISP to play the game of kalah, and it was demonstrated that the M & N procedure is significantly superior to the mini-max procedure. The statistical significance of important conclusions is given. Since information on statistical significance has often been lacking in papers on computer experiments in the artificial intelligence field, these experiments can perhaps serve as a model for future work.
Description Affiliation: Dept. of Health, Education and Welfare, Bethesda, MD (Slagle, James R.; Dixon, John K.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 13
Issue Number 3
Page Count 8
Starting Page 147
Ending Page 154


Open content in new tab

   Open content in new tab
Source: ACM Digital Library