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 repository contains the solution to Missionaries and Cannibal Problem using BFS and DFS search.
Three missionaries and three cannibals are on one side of a river, along with a boat that can hold one or two people. Find a way to get everyone to the other side without ever leaving a group of missionaries in one place outnumbered by the cannibals in that place.
This is a repository for Artificial Intelligence of my personal portfolio
Python program that solves a scaled-up version of the classic Missionaries and Cannibals problem in AI with an arbitrary number of missionaries and cannibals using breadth-first-search (BFS) algorithm.
Artificial Intelligence Assignment 2
Resolvendo o problema dos Missionarios e Canibais, usando BFS (Breadth-First Search).
Solution for the 1st problem in the Artificial Intelligence course at UFAL
artificial intelligence, assignment two
Resolução do problema dos Missionários e Canibais utilizando buscas bidirecional e em largura, além de modelagem por grafos.
Missionaries and cannibals problem resolved with Breadth-First Search
Python implementation of the classic Cannibals and Missionaries problem, which is a well-known search problem in Artificial Intelligence.
AI Based Missionaries and Cannibals Problem done in python using pygame Library
Implementation of famous search algorithms for Missionaries and Cannibals problem
A repository containing the practical works for the subject "artificial intelligence applications".
Add a description, image, and links to the missionaries-cannibals-problem topic page so that developers can more easily learn about it.
To associate your repository with the missionaries-cannibals-problem topic, visit your repo's landing page and select "manage topics."