Philip (Phil) Bursky,
an American electrical engineer and computer scientist. Along with James R. Slagle, Philip Bursky co-authored A Multipurpose, Theorem-Proving Heuristic Program using the game of Kalah^{[1]} .

Abstract of Experiments With a Multipurpose, Theorem-Proving Heuristic Program. ^{[6]} from the ACM Portal:

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, 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.

Home * People * Philip BurskyPhilip (Phil) Bursky,an American electrical engineer and computer scientist. Along with James R. Slagle, Philip Bursky co-authored

A Multipurpose, Theorem-Proving Heuristic Programusing the game of Kalah^{[1]}.Phil made his BS and MS in Electrical engineering at Massachusetts Institute of Technology in 1957 — 1963, and worked at Lawrence Radiation Laboratory, University of California and University of Pennsylvania. From 1982 he was Director, Software Development at

Interspec^{[2]}^{[3]}and from 1995 until 2008 as Technical Project Manager at Syncro Technology Corp.. He is member of the engineering honor society Tau Beta Pi and the electrical and computer engineering honor society Eta Kappa Nu^{[4]}.^{[5]}## Table of Contents

## Theorem-Proving

Abstract ofExperiments With a Multipurpose, Theorem-Proving Heuristic Program.^{[6]}from the ACM Portal: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, 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.## Selected Publications

^{[7]}1968).A Man-Machine Competitive Game: A Naval Duel. University of Pennsylvania1968).Experiments With a Multipurpose, Theorem-Proving Heuristic Program. Journal of the ACM, Vol. 15, No. 1^{[8]}1970).Man-Computer Problem Solving in Real-Time Naval Duels. University of Pennsylvania## External Links

## References

1968).Experiments With a Multipurpose, Theorem-Proving Heuristic Program. Journal of the ACM, Vol. 15, No. 1## What links here?

Up one level