IDEAS home Printed from
   My bibliography  Save this article

An Efficient Speedup Strategy for Constant Sum Game Computations


  • Alexandru-Ioan STAN



Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithms while analyzing large amounts of data. This premise leads naturally to the possibility of using efficient parallel computing implementations when seeking exact solutions to some of these problems. Although alpha beta algorithms for more than one-player game-tree searches show moderate parallel performance, this paper sets forth an alpha beta strategy enhanced with transposition tables in order to offer satisfactory speedups on high performance servers. When the access to the transposition tables is done in low constant delay time, the achieved speedups should approach the theoretical upper bounds of the code parallelism. We tested the strategy on a well-known combinatorial game.

Suggested Citation

  • Alexandru-Ioan STAN, 2014. "An Efficient Speedup Strategy for Constant Sum Game Computations," Informatica Economica, Academy of Economic Studies - Bucharest, Romania, vol. 18(4), pages 144-153.
  • Handle: RePEc:aes:infoec:v:18:y:2014:i:4:p:144-153

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Binmore, Ken, 2007. "Playing for Real: A Text on Game Theory," OUP Catalogue, Oxford University Press, number 9780195300574.
    Full references (including those not matched with items on IDEAS)


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:aes:infoec:v:18:y:2014:i:4:p:144-153. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Paul Pocatilu). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.