GitHub - santosgagbegnon/BreadthFirstSearch: A simple comparison of the brute force approach and breadth first search Algorithm approach to solving the insanity puzzle game.

santosgagbegnon / BreadthFirstSearch Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

A simple comparison of the brute force approach and breadth first search Algorithm approach to solving the insanity puzzle game.

0 stars 0 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 1 Commit
Color.class		Color.class
Color.java		Color.java
Cube.class		Cube.class
Cube.java		Cube.java
IllegalColorException.class		IllegalColorException.class
IllegalColorException.java		IllegalColorException.java
IllegalPositionException.class		IllegalPositionException.class
IllegalPositionException.java		IllegalPositionException.java
LinkedQueue$1.class		LinkedQueue$1.class
LinkedQueue$Node.class		LinkedQueue$Node.class
LinkedQueue.class		LinkedQueue.class
LinkedQueue.java		LinkedQueue.java
Queue.class		Queue.class
Queue.java		Queue.java
README.txt		README.txt
Solution.class		Solution.class
Solution.java		Solution.java
Solve.class		Solve.class
Solve.java		Solve.java

Repository files navigation


This program has two approaches to solving the instant insanity puzzle game. The first approach is a brute force method that tests all 24^4 possible orietnations, while the second algorithim has a more systematic appraoch. This shows the drastic difference in efficiency between the 2 methods.