Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.
-
Updated
Feb 17, 2018 - Python
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.
This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity
This is a repository for Artificial Intelligence of my personal portfolio
use a star algorithm to solve missionary and cannibals
Examples of uninformed (iddfs), infromed (a-star) and local (beam) search.
Add a description, image, and links to the cannibals topic page so that developers can more easily learn about it.
To associate your repository with the cannibals topic, visit your repo's landing page and select "manage topics."