• DocumentCode
    2222621
  • Title

    The importance of look-ahead depth in evolutionary checkers

  • Author

    Al-Khateeb, Belal ; Kendall, Graham

  • Author_Institution
    Sch. of Comput. Sci., Univ. of Nottingham, Nottingham, UK
  • fYear
    2011
  • fDate
    5-8 June 2011
  • Firstpage
    2252
  • Lastpage
    2258
  • Abstract
    Intuitively it would seem to be the case that any learning algorithm would perform better if it was allowed to search deeper in the game tree. However, there has been some discussion as to whether the evaluation function or the depth of the search is the main contributory factor in the performance of the player. There has been some evidence suggesting that look ahead (i.e. depth of search) is particularly important. In this work we provide a rigorous set of experiments, which support this view. We believe this is the first time such an intensive study has been carried out for evolutionary checkers. Our experiments show that increasing the depth of a look-ahead has significant improvements to the performance of the checkers program and has a significant effect on its learning abilities.
  • Keywords
    evolutionary computation; game theory; learning (artificial intelligence); trees (mathematics); evolutionary checkers; game tree; learning algorithm; look-ahead depth; Artificial intelligence; Artificial neural networks; Computer architecture; Computers; Games; Humans; Round robin;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Evolutionary Computation (CEC), 2011 IEEE Congress on
  • Conference_Location
    New Orleans, LA
  • ISSN
    Pending
  • Print_ISBN
    978-1-4244-7834-7
  • Type

    conf

  • DOI
    10.1109/CEC.2011.5949894
  • Filename
    5949894