This battleship bot tries to locate ships using probability.
There is an algorithm that tries to identify when a ship has been reasonably hit (however is very error prone) and will use that information to refine the search, particularly to prevent mindlessly searching in adjacent cells where we can determine it is impossible to the ship to be.
I honestly don't understand half the code at this point, I should sleep.
I hated not knowing when a ship had been sunk at first, but now see it as a unique constraint that has forced me to think deeper into optimizing the bot as best as I can.
Overall, was a fun challenge that pushed me to do more algorithmic stuff other than my usual full-stack dev.

Log in or sign up for Devpost to join the conversation.