• DocumentCode
    2415301
  • Title

    Time-bounded algorithm for two-player games

  • Author

    Krad, Hasan ; Petrakos, Kostas

  • Author_Institution
    Dillard Univ., New Orleans, LA, USA
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    312
  • Lastpage
    316
  • Abstract
    We present a time-bounded algorithm for two-player games, which generates partial game trees in accordance with the theme that when comparing the values of several alternative moves, the criterion should depend not only on their apparent scores but also on the amount of time already expended in their examination. We show that such an algorithm admits an interpretation as a generalized minmax search
  • Keywords
    computer games; game theory; minimax techniques; tree searching; trees (mathematics); 2-player games; alternative moves; apparent scores; escape function; expended examination time; generalized minmax search algorithm; partial game trees; time-bounded algorithm; value comparison; Cities and towns; Minimax techniques;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    SoutheastCon, 2002. Proceedings IEEE
  • Conference_Location
    Columbia, SC
  • Print_ISBN
    0-7803-7252-2
  • Type

    conf

  • DOI
    10.1109/.2002.995611
  • Filename
    995611
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2415301