This repository contains the solution to Missionaries and Cannibal Problem using BFS and DFS search.
-
Updated
Mar 23, 2024 - Python
This repository contains the solution to Missionaries and Cannibal Problem using BFS and DFS search.
This is a repository for Artificial Intelligence of my personal portfolio
Examples of uninformed (iddfs), infromed (a-star) and local (beam) search.
use a star algorithm to solve missionary and cannibals
Problema dos canibais e missionários resolvido com o algoritmo de Busca em Largura.
This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening search.
Add a description, image, and links to the missionaries topic page so that developers can more easily learn about it.
To associate your repository with the missionaries topic, visit your repo's landing page and select "manage topics."