Missionaries and cannibals problem resolved with Breadth-First Search
-
Updated
Jun 17, 2015 - Python
Missionaries and cannibals problem resolved with Breadth-First Search
Implementation of classic search algorithms in Common Lisp
AI Based Missionaries and Cannibals Problem done in python using pygame Library
Python program that solves the Missionaries and Cannibals problem, a toy problem in AI, with iterative deepening 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.
Missionaries and cannibals solver written in common Lisp
Solution for the Missionaries and Cannibals problem using Message Queues and Multiprocessing
This Python implementation is a scaled up version of the Missionaries and Cannibals problem with arbitary number of missionaries, cannibals and boat capacity
AI Lab Offlines and Onlines
Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET
missionaries and cannibals problem as desribed to learn to use the aima library
Missionaries and Cannibals Problem
Artificial Intelligence Assignment 2
Resolvendo o problema dos Missionarios e Canibais, usando BFS (Breadth-First Search).
Os missionários e canibais / Trabalho Prático IA
artificial intelligence, assignment two
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.
This is a repository for Artificial Intelligence of my personal portfolio
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."