missionaries-and-cannibals and Missionaries-and-Cannibals-Problem-Python
These are competitors—both solve the same classic AI search problem (Missionaries and Cannibals) in Python, with the key difference being that one is fixed to the canonical 3-3-2 problem while the other generalizes to arbitrary parameters.
About missionaries-and-cannibals
gbroques/missionaries-and-cannibals
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.
This program helps solve classic logic puzzles like the Missionaries and Cannibals problem. You input the initial setup of a constrained movement puzzle, and it outputs a step-by-step solution. It's designed for anyone interested in exploring solutions to well-known artificial intelligence challenges or educational problem-solving.
About Missionaries-and-Cannibals-Problem-Python
Subangkar/Missionaries-and-Cannibals-Problem-Python
This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity
This project helps students and educators studying Artificial Intelligence to solve the classic Missionaries and Cannibals problem, even when scaled up to a larger number of people and boat capacity. You provide the number of missionaries, cannibals, boat capacity, and search limits as input. The project then generates text files outlining the step-by-step solutions found by Breadth-First Search and Depth-First Search algorithms. This is ideal for computer science students learning about search algorithms or AI educators demonstrating problem-solving.
Related comparisons
Scores updated daily from GitHub, PyPI, and npm data. How scores work