In the missionaries and cannibals problem, three missionaries and three cannibals must cross a river using a boat which can carry at most two people, under the constraint that, for both banks, if there are missionaries present on the bank, they cannot be outnumbered by cannibals (if they were, the cannibals would eat the missionaries.) The boat cannot cross the river by itself with no people on board.
*Description of game rules derived from its Wikipedia page and is released under the Creative Commons license.
Download LinksAssociated Agents
- There is one basic agent embedded within the environment that will automatically be sourced when you launch it.
Documentation
- While there is no explicit documentation, the Soar Debugger tutorial does have a section that explains how to hook up the debugger to this type of environment.
Code:
(I2 ^left-bank L1 ^right-bank R4) (L1 ^boat 1 ^cannibals 3 ^missionaries 3 ^other-bank R4) (R4 ^boat 0 ^cannibals 0 ^missionaries 0 ^other-bank L1)) (I3 ^move-boat M1) (M1 ^boat 1 ^cannibals 2 ^from-bank L1)
- Taylor Lafrinere
- Soar 8, 9
- C++