Solving missionaries and canniblas problem! Finding out the best solutions(cost, time) for given number of missionaries and cannibals, also allow to limit time and cost.
MC.cpp is for basic needs of the game
MC_limited.cpp is for the game where time and cost are limited
log.txt is the process of the moving missionaries and cannibals
C++
Approach of using Astar, dijkstra, and Bread First Search in order to find the solutions of every given conditions. Manhattan distance for suitable hueristic value.