![]() Here, Berry’s algorithm considers all of the possible configurations of the five ships and calculates a probability that any given square is occupied by a ship. ![]() Berry’s most efficient approach to Battleship uses a probability density function, which takes into consideration the different ways the ships can fit across the board.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |