In today's gaming world, a player expects the same play experience whether playing on a local network or online with many geographically distant players on congested networks. Because of delay and loss, there may be discrepancies in the simulated environment from player to player, likely resulting in incorrect perception of events. It is desirable to develop methods that minimize this problem. Dead reckoning is one such method. Traditional dead reckoning schemes typically predict a player's position linearly by assuming players move with constant force or velocity. In this paper, we consider team-based 2D online action games. In such games, player movement is rarely linear. Consequently, we implemented such a game to act as a test harness we used to collect a large amount of data from playing sessions involving a large number of experienced players. From analyzing this data, we identified play patterns, which we used to create three dead reckoning algorithms. We then used an extensive set of simulations to compare our algorithms with the IEEE standard dead reckoning algorithm and with the recent "Interest Scheme" algorithm. Our results are promising especially with respect to the average export error and the number of hits.

Additional Metadata
Persistent URL dx.doi.org/10.1155/2014/138596
Journal International Journal of Computer Games Technology
Citation
Shi, W, Corriveau, J, & Agar, J. (Jacob). (2014). Dead reckoning using play patterns in a simple 2d multiplayer online game. International Journal of Computer Games Technology. doi:10.1155/2014/138596