Three wolves are taking three sheep (friends; not food) to their favorite pasture for grazing. Unfortunately, they must cross a canyon by way of a blind chicken who can only hold up to two passengers. The wolves must find a way to bring the sheep across without ever overpowering them in numbers(at which point they will forget their refinement and eat all of the sheep). How should they go about solving this problem?
This was a project I created for a final in a Programming Languages course to demonstrate the calculation potential in Minecraft. It follows the Missionaries and Cannibals rules and generates a solution.
Three wolves are taking three sheep (friends; not food) to their favorite pasture for grazing. Unfortunately, they must cross a canyon by way of a blind chicken who can only hold up to two passengers. The wolves must find a way to bring the sheep across without ever overpowering them in numbers(at which point they will forget their refinement and eat all of the sheep). How should they go about solving this problem?
This was a project I created for a final in a Programming Languages course to demonstrate the calculation potential in Minecraft. It follows the Missionaries and Cannibals rules and generates a solution.
ot w6fgl' 26gLc4!ua toL gq^6ufnL6 gwoua f46 2fgL2°
l!k6 pnL2f2 ot l!a4f ` f46,\ l6tf f46 blgu6f !u 24!b2