A Java project for the search problem Missionaries and Cannibals. The project relies on BFSearch algorithm to expand and find the solution among the rest of the possible game outcomes. The results of the BFSearch is stored in the txt file "output.txt", as it stored the result of all nodes expansion and the solution at the end.
An example of the output is like that:
_____🛶_ OOOXXX 🪵
🢀
XX _🛶_____ OOOX
🢂
X _____🛶_ OOOXX
🢀
🢂
XX _____🛶_ OOOX
🢀
🢂
XO _____🛶_ OOXX
🢀
🢂
🢀
🢂
🢀