Strings and Water Puzzles in Java using BFS
Budget: $30 – $250 USD
In the first part of the project you will work individually to design and implement two Java programs that can solve two relatively simple puzzles:
- A strings puzzles where we try to move as quickly as possible from a starting string to a finish string by rotating letters one position at a time.
- A water puzzle with a series of different sized buckets and a desired amount of water in a bucket.
Both puzzles will use a common solver. The solver will employ the BFS (breadth first search) algorithm in order to find the least number of moves it takes to reach the solution.
- A strings puzzles where we try to move as quickly as possible from a starting string to a finish string by rotating letters one position at a time.
- A water puzzle with a series of different sized buckets and a desired amount of water in a bucket.
Both puzzles will use a common solver. The solver will employ the BFS (breadth first search) algorithm in order to find the least number of moves it takes to reach the solution.