 Newell and Simon tried to capture a general version of this algorithm in a program called the " General Problem Solver " . Other " searching " programs were able to accomplish impressive tasks like solving problems in geometry and algebra , such as Herbert Gelernter 's Geometry Theorem Prover ( 1958 ) and SAINT , written by Minsky 's student James Slagle ( 1961 ) . Other programs searched through goals and subgoals to plan actions , like the STRIPS system developed at Stanford to control the behavior of their robot Shakey . 
 Newell and Simon tried to capture a general version of this algorithm in a program called the " General Problem Solver " . Other " searching " programs <a href='uninflect' title='1'><mark>were</mark></a> able to accomplish impressive tasks like solving problems in geometry and algebra , such as Herbert Gelernter <a href='null_genetive' title='2'><mark>'s</mark></a>Geometry Theorem Prover ( 1958 ) and SAINT , written by Minsky <a href='null_genetive' title='3'><mark>'s</mark></a>student James Slagle ( 1961 ) . Other programs searched through goals and subgoals to plan actions , like the STRIPS system developed at Stanford to control the behavior of their robot Shakey . 
Newell and Simon tried to capture a general version of dis algorithm in a program called da " General Problem Solver " . Other " searchin " programs was able to accomplish impressive tasks like solving problems in geometry and algebra , such as Herbert Gelernter  Geometry Theorem Prover ( 1958 ) and SAINT , written by Minsky  student James Slagle ( 1961 ) . Other programs searched through goals and subgoals to plan actions , like the STRIPS system developed at Stanford to control the behavior of their robot Shakey .