IDEAS home Printed from https://ideas.repec.org/
MyIDEAS: Log in (now much improved!) to save this article

An Efficient Speedup Strategy for Constant Sum Game Computations

Listed author(s):
  • Alexandru-Ioan STAN

    ()

Registered author(s):

    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.

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.

    File URL: http://www.revistaie.ase.ro/content/72/13%20-%20Stan.pdf
    Download Restriction: no

    Article provided by Academy of Economic Studies - Bucharest, Romania in its journal Informatica Economica.

    Volume (Year): 18 (2014)
    Issue (Month): 4 ()
    Pages: 144-153

    as
    in new window

    Handle: RePEc:aes:infoec:v:18:y:2014:i:4:p:144-153
    Contact details of provider: Postal:
    6 ROMANA PLACE, 70167 - BUCHAREST

    Phone: 0040-01-2112650
    Fax: 0040-01-3129549
    Web page: http://revistaie.ase.ro/
    Email:


    More information through EDIRC

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:

    as
    in new window

    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)

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    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)

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 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.

    This information is provided to you by IDEAS at the Research Division of the Federal Reserve Bank of St. Louis using RePEc data.