Monkeys and Bananas
- Monkeys and Bananas is a classic Good Old Fashioned AI model.
- A monkey's behaviour is described by rules and he moves around to
get fruit.
- To show that we can do rules, we implemented the monkeys and bannas
problem with three rules.
- One is (MonkeyCanReach ?x) => (assert (MonkeyGrab ?x))
(retract (MonkeyCanReach ?x)
- There are two other rules, one for moving the chair to the
position of the fruit, and another for eating the fruit.
- The system also needs to have a piece fruit at a position, and a chair
at a position.
- The rastergram represents the neural firing of the system.
- Initially, there are two pieces of fruit (a banana and an apple
at postions 2 and 3) and a chair at position 1.
- The monkey moves the chair (oddly simulatneously to two places),
grabs the fruit, and eats it.