Your job is to create a battleship "solver". The code provided is to initialze and allocate a board and stub methods to place ships on that board. all ships are 1x1.
Your job is to implement an algorithm to search the board for ships in as few guesses as possible.
The guess returns 3 options:
- Miss No ships adjacent to the guess
- Near Miss No Ship at guess, but ship is in an adjacent square
- Hit Ship is at guess