The Classic Battleship™ game implemented between a computer bot and a player's bot.
You and your opponent have 9 ships of various sizes.
These Ships/Sizes/Qty are Carrier-5, Battleship-4, Submarine-3(qty 2), Cruiser-3(qty 2), Destroyer-2(qty 3).
The board is 10x10. (index 1-100) Unknown=0, Miss=1, Hit=2
The Play:
Player places his ships on the board. Ships may not overlap but may touch.
Ships array is [9,2] where 1 is the Carrier and 9 is a Destroyer.
[start_idx, orientation; start_idx, orientation...]. An orientation of 0 is Down and a 1 is Right.
Ships[1 1;...] places the Carrier in cells [1 11 22 33 44]
Player takes a shot on the board - idx 1:100.
The computer bot will take a shot if he has any ships remaining.
The player will see an updated board for his next shot if he has any ships remaining.
Pass: Win
Battleship_bot_000 randomly fires.
There is a Bernoulli probability question if this strategy could ever win against anything but another random bot.
Solution Stats
Problem Comments
Solution Comments
Show commentsProblem Recent Solvers26
Suggested Problems
-
4573 Solvers
-
129 Solvers
-
Back to basics 3 - Temp Directory
386 Solvers
-
Solve the set of simultaneous linear equations
504 Solvers
-
Fahrenheit to Celsius converter
607 Solvers
More from this Author306
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!