An adaptive tree pruning system: A language for programming heuristic tree searches

Authors:
Edward W. Kozdrowicki
Affiliations:
-
Venue:
ACM '68 Proceedings of the 1968 23rd ACM national conference
Year:
1968

Citing 0
Cited 3

Experiments with the M & N tree-searching program

Communications of the ACM
COKO III: the Cooper-Koz chess program

Communications of the ACM
Experiments in automatic learning for a multipurpose hueristic program

Communications of the ACM

Quantified Score

Hi-index	0.05

Visualization

Abstract

The tree pruning system (TPS) consists of a set of commands designed for programming heuristic tree searches. This system was assembled as a pre-FORTRAN compiler similar in principle to that of FORMAC. TPS and FORTRAN IV statements are used together for writing programs. In the present implementation, each TPS command must be preceded by an asterisk (*) in the first column to distinguish it from a regular FORTRAN statement. TPS has the two-fold purpose of being a language for manipulating tree-structured data formations and also encompassing machine-learning capability.