Thumbnail
Access Restriction
Subscribed

Author Slagle, James R. ♦ Bursky, Philip
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1968
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract The heuristic program discussed searches for a constructive proof or disproof of a given proposition. It uses a search procedure which efficiently selects the seemingly best proposition to work on next. This program is multipurpose in that the domains it can handle are varied.As an initial experiment, the program was given the task of searching for proofs and disproofs of propositions about kalah end games. Kalah is a two-person game. In another experiment the program, after some modifications, $\textit{played}$ the game of kalah. This program was compared with another tree-searching procedure, the Alpha-Beta minimax procedure; the results have been encouraging since the program is fast and efficient. Its greatest usefulness is in solving large problems. It is hoped that this program has added one more step toward the goal of eventually obtaining computer programs which can solve intellectually difficult problems.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1968-01-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 15
Issue Number 1
Page Count 15
Starting Page 85
Ending Page 99


Open content in new tab

   Open content in new tab
Source: ACM Digital Library