• DocumentCode
    3712988
  • Title

    Candidate Moves Method implementation in MiniMax search procedure of the Achilles chess engine

  • Author

    Vladan Vuckovic

  • Author_Institution
    Faculty of Electronic Engineering, University of Nis, Aleksandra Medvedeva 14, 18000, Serbia
  • fYear
    2015
  • Firstpage
    314
  • Lastpage
    317
  • Abstract
    This paper presents the Candidate Moves Method for parallelization of the MiniMax search procedure. As the framework for this new method the basic MiniMax procedure is defined. The original modification of the classic MiniMax procedure is presented in detail. All of these theoretical results and novelties are successfully implemented and verified in authors´ chess application Achilles, which is the cluster version of the Axon chess engine.
  • Keywords
    "Games","Computers","Engines","Decision trees","Decision making","Clustering algorithms","Programming"
  • Publisher
    ieee
  • Conference_Titel
    Telecommunication in Modern Satellite, Cable and Broadcasting Services (TELSIKS), 2015 12th International Conference on
  • Print_ISBN
    978-1-4673-7515-3
  • Type

    conf

  • DOI
    10.1109/TELSKS.2015.7357795
  • Filename
    7357795
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3712988