The views expressed here are those of the individual authors and not necessarily those of the JSM sponsors, their officers, or their staff.
Online Program Home
Abstract Details
|
Activity Number:
|
154
|
|
Type:
|
Invited
|
|
Date/Time:
|
Monday, July 30, 2012 : 10:30 AM to 12:20 PM
|
|
Sponsor:
|
JSM 2012 Host Local Chapter - San Diego
|
| Abstract - #304414 |
|
Title:
|
How To Beat Kindergartners at Battleship
|
|
Author(s):
|
Stephen Robinson*+
|
|
Companies:
|
Belmont University
|
|
Address:
|
Department of Chemistry and Physics, Nashville, TN, 37212, United States
|
|
Keywords:
|
games ;
probability
|
|
Abstract:
|
At first glance, the popular board game of Battleship does not lend itself to strategy until at least the first successful hit is made. Even then, it is difficult to determine the best grid point to guess at next. However, simulations of possible ship configurations on various board sizes and with different spacings reveal clear patterns of high and low probability ship placement (assuming random placement). These patterns can then be used, depending on whether the preceding shot was a hit or miss, to discern the best possible shot paths to take; this ultimately leads to a clear and quantitative advantage over random guessing.
|
The address information is for the authors that have a + after their name.
Authors who are presenting talks have a * after their name.
Back to the full JSM 2012 program
|
2012 JSM Online Program Home
For information, contact jsm@amstat.org or phone (888) 231-3473.
If you have questions about the Continuing Education program, please contact the Education Department.