Advertisement

ORTS: A Hack-Free RTS Game Environment

  • Michael Buro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2883)

Abstract

This paper presents a novel approach to Real-Time-Strategy (RTS) gaming which allows human players as well as machines to compete in a hack-free environment. The main idea is to replace popular but inherently insecure client-side game simulations by a secure server-side game simulation. Only visible parts of the game state are sent to the respective clients. Client-side hacking is therefore impossible and players are free to choose any client software they please. We discuss performance issues arising from server-side simulation and present ORTS – an open RTS game toolkit. This software package provides efficient C++ implementations for 2D object motion and collision detection, visibility computation, and incremental server-client data synchronization, as well as connectivity to the Generic Game Server (GGS). It is therefore well suited as a platform for RTS related A.I. research.

Keywords

Information Hiding Collision Time Game State Game Simulation Client Software 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buro, M.: ORTS project (2002), http://www.cs.ualberta.ca/~mburo
  2. 2.
    Bettner, P., Terrano, M.: 1500 archers on a 28.8: Network programming in Age of Empires and beyond. Gamasutra (2001), http://www.gamasutra.com/features/20010322/terrano_01.htm
  3. 3.
    Pritchard, M.: How to hurt the hackers: The scoop on Internet cheating and how you can combat it. Gamasutra (2000), http://www.gamasutra.com/features/20000724/pritchard_01.htm
  4. 4.
    Cohen, J., Lin, M., Manocha, D., Ponamgi, K.: I-Collide: An interactive and exact collision detection system for large-scaled environments. In: ACM International 3D Graphics Conference, pp. 189–196 (1995)Google Scholar
  5. 5.
    McCreight, E.: Priority search trees. SIAM Journal on Computing 14, 257–276 (1985)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 23, 337–342 (1977), Implemented for instance in zlib http://www.gzip.org/zlib Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Michael Buro
    • 1
  1. 1.NEC Research InstitutePrinceton

Personalised recommendations