Experiments with the Graph Traverser program

@article{Doran1966ExperimentsWT,
  title={Experiments with the Graph Traverser program},
  author={J. Doran and D. Michie},
  journal={Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences},
  year={1966},
  volume={294},
  pages={235 - 259}
}
  • J. Doran, D. Michie
  • Published 1966
  • Mathematics
  • Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences
An automatic method is described for the solution of a certain family of problems. To belong to this family a problem must be expressible in the language of graph theory as that of finding a path between two specified nodes of a specified graph. The method depends upon the evaluation of intermediate states of the problem according to the extent to which they have features in common with the goal state. We define evaluation functions each of which assigns to any state of the problem a value… Expand
190 Citations

Figures and Tables from this paper

AN APPROACH TO AUTOMATIC PROBLEM -SOLVING
  • 48
Heuristically Guided Search and Chromosome Matching
  • 16
Properties of heuristic search strategies
  • 1
A Problem Similarity Approach to Devising Heuristics: First Results
  • 71
  • PDF
Speeding up Problem Solving by Abstraction: A Graph Oriented Approach
  • 125
  • PDF
Graph Search and Strips Planning
  • 1992
  • 1
Heuristic Search Viewed as Path Finding in a Graph
  • I. Pohl
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1970
  • 364
  • PDF
Some Binary Derivation Systems
  • 3
Bi-directional and heuristic search in path problems
  • 149
  • PDF
An Admissible and Optimal Algorithm for Searching AND/OR Graphs
  • 88
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
AN APPROACH TO AUTOMATIC PROBLEM -SOLVING
  • 48
Notes on the "15" Puzzle
  • 114
An approach to automatic
  • 1966
Computer Design of Electricity Supply Networks by a Heuristic Method
  • 14
  • PDF
Strategy - building with the GraphTrav ~ rser
  • 1966
Strategy - building with theGraphTraverser
  • Machine intelligence
  • 1966
Theorem proving by , Beth tree methods
  • 1966
Theorem proving by Beth tree methods
  • Machine intelligence
  • 1966
1965a, b, c Mathematical games. Scient
  • 1965
A qu ~ tItat ~ ve study . of p ~ blem - solVlllg usmg sliding block puzzles : the ' EIght - puzzle ' and a modified versIon ! ' ofthe Alexander Passalong Test
  • 1965
...
1
2
...