Battleship Strategy

You are to write a program that will play a limited game of battleshipwhere you attempt to sink all of the ships with a minimum number of shots. The game of battleship is typically played with two players, each of which place 5 ships of various sizes on a 10 x 10 grid. Each player on a turn by turn basis attempts to place a shot where the opponent has placed a ship. Of course, your opponent can not see where you have placed your ships and you cannot see where the opponent has placed their ships. You typically call out shots to try and find and sink each of your ships. The player that can sink all of the opponent ships first is the winner. For a more complete description see Battleship. The following video ([login to view URL]) is a great resource for everyone. It covers an introduction on how to play the game and many strategies for playing the game. In this instance of Battle Ship the computer will randomly place 5 ships (lengths 2,3,3,4,5) on the board. A total of 17 spaces on the board out of 100 will have a ship. Once you obtain 17 hits you have solved the game. Your goal is to achieve the lowest average number of shots to do this. There are many different strategies to solve this problem. Please note, this is not a full implementation of the game. The computer will not be firing on you. It is up to you to come up with an algorithm to find the computer’s ships in the least number of shots.