Skip to content

Solving Missionaries and Cannibals Problem by implementing AI Search Strategies

Notifications You must be signed in to change notification settings

jalpa015/missionaries-cannibal-problem

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 

Repository files navigation

Implementation of AI Search Techniques to solve the Missionaries and Cannibal Problem

The following AI Search techniques have been used to solve the famous Missionaries and Cannibals problem:

a. Breadth First Search

b. Depth First Search

c. Iterative Deepening Search

The comparison is made by comparing the time taken to execute the program, also by the nodes that has been expanded to reach the goal state.

Installation Guide

  • To run this project, install the project, build and run the Main.java file

About

Solving Missionaries and Cannibals Problem by implementing AI Search Strategies

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages