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.

Using breadth-first-search, depth-first-search, A* algorithm to solve 8-puzzle-problem and missionaries-cannibals-problem

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.

Solution for the Missionaries and Cannibals problem using Message Queues and Multiprocessing

Solving missionary cannibal problem using different search strategies in C

Missionaries and cannibals solver written in common Lisp

missionaries and cannibals problem and solution implemented using DFS,BFS and bidirectional BFS.

Missionaries and Cannibals Problem

Artificial Intelligence Assignment 2

Assignments of Artificial Intelligence Sessional Course CSE 318 in Level-3, Term-2 of CSE, BUET

Resolvendo o problema dos Missionarios e Canibais, usando BFS (Breadth-First Search).

Solution for the 1st problem in the Artificial Intelligence course at UFAL

AI Lab Offlines and Onlines

🚀 Welcome to the AIML Repository! 📚✨ Dive into a treasure trove of AI and Machine Learning knowledge. 🤖💡 Explore meticulously curated notes, textbooks, and program resources. 📖👩‍💻 Your go-to source for mastering AIML in an exciting learning space! 🌐

Implementation of classic search algorithms in Common Lisp