• DocumentCode
    2674007
  • Title

    Hash table in Chinese Chess

  • Author

    Huizhan, Lv ; Chenjun, Xiao ; Hongye, Li ; Jiao, Wang

  • Author_Institution
    Coll. of Inf. Sci. & Eng., Northeastern Univ., Shenyang, China
  • fYear
    2012
  • fDate
    23-25 May 2012
  • Firstpage
    3286
  • Lastpage
    3291
  • Abstract
    Hash table is a very important technique in computer games. With the development of computer Chinese Chess, hash table is wildly used and some of implementations are innovational. Several notable hash table implementations are introduced, some of them being new, while some combing with the specific modification on traditional ones, all considering special characteristics of Chinese Chess. The two common methods, Zobrist hashing and lockless algorithm in parallel search, are also put forward. The experimental results reveal these hash tables are remarkable and essential, significantly improving the overall performance.
  • Keywords
    computer games; data structures; Chinese chess; Zobrist hashing; computer games; hash table; lockless algorithm; parallel search; Algorithm design and analysis; Computers; Decision trees; Games; Humans; Memory management; Upper bound; Hash table; Minors hash table; Opening book; Transposition table; Zobrist hashing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Control and Decision Conference (CCDC), 2012 24th Chinese
  • Conference_Location
    Taiyuan
  • Print_ISBN
    978-1-4577-2073-4
  • Type

    conf

  • DOI
    10.1109/CCDC.2012.6244521
  • Filename
    6244521