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.
No commits in the last 6 months.
Use this if you are a computer science student or educator looking to explore and solve the Missionaries and Cannibals problem with variable parameters and see different search strategies in action.
Not ideal if you are looking for a general-purpose AI problem solver or a tool for real-world logistical planning.
Stars
13
Forks
10
Language
Python
License
—
Category
Last pushed
Nov 25, 2018
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/Subangkar/Missionaries-and-Cannibals-Problem-Python"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Compare
Higher-rated alternatives
AGalassi/TablutCompetition
Software for the Tablut Students Competition
gbroques/missionaries-and-cannibals
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with...
MatteoFasulo/Tablut
Project for the MSc in Artificial Intelligence of the University of Bologna, academic year...
Gionnino9000/Gionnino9000
La nostra soluzione per la Tablut Challenge 2022 ♟️ (Fondamenti di Intelligenza Artificiale M)
Bishalsarang/Missionaries-and-Cannibals-Problem
This repository contains the solution to Missionaries and Cannibal Problem using BFS and DFS search.