chess

• Claude E. Shannon, Programming a Computer for Playing Chess
• broad introduction, cover many aspects
  • T.A. Marsland, [The Anatomy of Chess Programs]
• FIDE Laws of Chess July 1997
• forum
  • http://www.talkchess.com/forums/1/index.html
    • CCC Search Engine
  • Chess Forum
• programs
  • gnuchess
  • crafty
    • Crafty HomePage
  • arasan
  • Phalanx
• 国际象棋译文苑
  • 专题译文
    • ELO等级分体系
    • 组织电脑棋比赛初步
    • 先进国际象棋
    • 关于PGN和FEN记谱规范 [上] [下]
    • 人机大战：无尽魅力
    • Shredder成功背后的秘密
    • 电脑国际象棋简史
    • Tony电脑国际象棋时事5
  • 棋局中的时间运用管理

chinese chess

• Computer Chinese Chess
• 黄阿姨电脑象棋世界
• 象棋百科全书
• Xiangqi and combinatorial game theory
• basic
  • http://www.chessvariants.com/xiangqi.html
• 棋譜
  • 网上棋牌乐-象棋会珍阁　棋谱库
    • 最新镜像站点 (但有些舊的不見了?)
  • 樂在其中
  • 李瑜辉个人主页
  • XIANGQI DATABASES
  • 馬全清的象棋研究室
  • 中国象棋棋谱搜索
• puzzle
  • Xiangqi Puzzle Competition
  • http://www.cs.wisc.edu/~rushan/puzzle.html
  • 排局征答
  • 有獎徵答
• rules
  • 亞洲棋規
    • 亞象聯棋例摘要
    • 亞洲棋例
    • 2003 update
    • 2003 update
  • 大陸棋規
    • 中国象棋竞赛规则
  • 台灣棋規
    • 中華民國象棋規則（中華民國八十五年九月 修訂）
    • 中華民國象棋文化協會 最新棋規
    • 中華民國象棋文化協會 最新棋規
  • online chess game rule
    • http://www.clubxiangqi.com/rules/
    • 弈天棋规
• program
  • with source code
    • Ki11egg aka MRSD
    • vsccp, Very Simple Chinese Chess Program
    • The XiangQi Engine Project
  • shiga 象棋世家
  • xiexie 謝謝
  • zmbl 縱馬奔流
  • xqlearner 棋隱
  • Qianhong 淺紅
• forum
  • http://www.nchess.com/forum/
  • http://www.xqlearner.com/invboard/index.php
• endgame
  • [Jih-tung Pai's 象棋殘局庫查詢系統 (Chinese Chess Endgame Databases Query System)]
  • Using patterns and plans in end-games of Chinese chess
• file format
  • Chinese Chess File Format .ccf
  • 幻思的棋譜格式 .SG
  • 象棋演播室(XQStudio) .xqf 1.0
  • FEN for chinese chess
• site with lots meterial
  • 中國象棋資料中心
  • 楚河漢界象棋網
    • 象棋教室
    • 名人實戰
    • 殘局秘蒐
    • 棋譜下載
  • 中象网
    • 名局欣赏
    • 象棋教室
    • 棋人棋事
  • 象棋教室
  • 象棋天地

how to write chess program

• Strategy Game Programming
• REBEL [http://members.home.nl/matador/chess830.htm], [http://members.home.nl/matador/chess840.htm], [History Reductions]
• bitmap
  • http://www.computerschach.de/freeware/bitboards.htm
  • Chess program board representations
  • Rotated bitmaps, a new twist on an old idea
  • First bitboard chinese chess engine?
• gamedev [Chess Programming Part I], [II], [III], [IV], [V], [VI].
• [Bruce Moreland's Computer Chess] and [Chess Programming Topics]
• UCI ICS course: Strategy and board game programming
• Parallel Computing Work section 14.3 Computer Chess
• Chess Programming Theory
• Further notes on computer chess
• chinese chess
  • Poor專欄
  • PC遊戲編程（人機博弈）
  • 《c++ builder程序设计范例-中国象棋》 清华大学出版社 2002
    • 源代碼
  • 人机对弈程序 by 南京航空航天大学信息与计算科学专业 陶善文
• How someone's program plays chess
  • How DARKTHOUGHT plays chess
  • how Rival plays chess
  • Hossa
  • 電腦象棋程式達奕設計與製作
  • 电脑象棋的设计与实现
• Some aspects of chess programming
• A Beginner's Guide to Chess Programming

chess engine interface

• Universal Chess Interface
• Xboard Chess Engine Communication Protocol
• cxboard
• Qianhong Xiangqi Plugin Specification

search algorithms

• An analysis of alpha-beta pruning 1975
• A Re-examination of Brute-Force Search 1993
• SSS* = Alpha-Beta + TT 1994
• Nearly Optimal Minimax Tree Search? 1994
• A New Paradigm for Minimax Search 1994
• Exploiting Graph Properties of Game Trees
• An Algorithm Faster than NegaScout and SSS* in Practice 1995
  • [revised]
• A Minimax Algorithm Better than Alpha-Beta? No and Yes 1995
• MTD(f)
  • Research Re: search & Re-search
  • MTD(f)
  • Best-First Fixed-Depth Minimax Algorithms
• A theory of game trees, based on solution trees
• Are There Practical Alternatives To Alpha-Beta in Computer Chess?
• Selective Depth-First Search Methods 1997
• A Comparison of Game Tree Search Algorithms with Minimal Window
• ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm 1995
• Experiments with Multi-ProbCut and a New High-Quality Evaluation Function for Othello 1997
• A generalized quiescence search algorithm
• Singular extensions: Adding selectivity to brute-force searching
• Alpha-Beta Search Revisited 2002
• Game Tree Searching and pruning
• Conspiracy/Proof-number search
  • Conspiracy numbers for min-max search 1988
  • Conspiracy numbers 1990
  • Alpha-Beta-Conspiracy Search 1993
  • Proof-Number Search 1994
  • A new AND/OR tree search algorithm using proof number and disproof number 1998
  • Controlled Conspiracy-2 Search
  • AND/OR-Tree-Search Algorithms in Shogi Mating Search 2001
  • PN, PN² and PN^* in Lines of Action 2001
  • DF-PN IN GO: AN APPLICATION TO THE ONE-EYE PROBLEM
  • Combining Proof-Number Search with Alpha-Beta Search 2001
  • Proof Set Search 2001
  • The PN-search algorithm: application to tsume-shogi 2001
  • PDS-PN: A New Proof-Number Search Algorithm 2003
  • An effective two-level proof-number search algorithm 2004
• Selected search
  • Abstract Proof Search 2000
  • Iterative Widening 2001
  • Lambda-Search in Game Trees - with Application to Go 2001
  • Gradual abstract proof search 2002
  • Admissible Moves in Two-Player Games
  • Selective depth-first game-tree search 2002 (PhD thesis)
• A Generalized Threats Search Algorithm 2003
• Graph History Interaction Problem (GHI)
  • The Graph-History Interaction: On Ignoring Position History 1985
  • A Solution to the GHI Problem for Best-First Search 2001
  • A Solution to the GHI Problem for Depth-First Proof-Number Search 2003
  • A General Solution to the Graph History Interaction Problem 2004
• A New Approach to Draw Detection by Move Repetition in Computer Chess Programming
• Variable Depth Search

Search Heuristic/Moves Ordering

• The History Heuristic 1983
• The History Heuristic and Alpha-Beta Search Enhancements in Practice 1989
• The History Heuristic and the Performance of Alpha-Beta Enhancements 1989
• transposition tables
  • Analysis of Transposition Tables and Replacement Scheme
  • Replacement Schemes for Transposition Table
  • Information in Transposition Tables
• The Neural MoveMap Heuristic in Chess
• Computer chess move-ordering schemes using move influencs
• Learning extension parameters in game-tree search
• The Relative History Heuristic 2004
• Game Tree Search with Adaptive Resolution 2012 Hung-Jui Chang, Meng-Tsung Tsai, Tsan-sheng Hsu

Pruning

• null-move
  • Plenkner, S. (1995). A null-move technique impervious to zugzwang. ICCA Journal, Vol. 18, No. 2, pp. 82--84.
  • [Verified Null-Move Pruning], [pdf]
  • Some Null Move Strategies for Minimax Search
  • Adaptive null-move pruning
• Adaptive null-move pruning
• Pruning Nodes in the Alpha-Beta Method Using Inductive Logic Programming
• An Analysis of Forward Pruning
• A Least-Certainty Heuristic for Selective Search
• Relevance Cuts: Localizing the Search
• The Neural MoveMap Heuristic in Chess
• Multi-cut Pruning in Alpha-Beta Search
• Risk Management in Game-Tree Pruning
• A Review of Game-Tree Pruning
• Extended futility pruning
• Enhanced Forward Pruning 2003
• Alpha-Beta with Sibling Prediction Pruning in chess

Evaluation function

• Statistical Feature Combination for the Evaluation of Game Positions 1995
• From Simple Features to Sophisticated Evaluation Functions 1998
• Tuning Evaluation Functions for Search
• Rookie's evaluation function: A pattern-recognition strategy for chess position evaluation
• Deep Thought's evaluation function tuning
• An Evolutionary Approach for the Tuning of a Chess Evaluation
• Strategy and board game programming: Evaluation Functions
• Automatic Generation of an Evaluation Function for Chess Endgames 2000
• Adaptive genetic algorithm's implement on evaluation function in computer Chinese chess 2005
• 中国象棋计算机博弈系统评估函数的自适应遗传算法实现
• 電腦象棋程式位置評分表之研究 2006

Endgame

• Validating a range of endgame programs 1992
• Solving Large Retrograde-Analysis Problems Using a Network of Workstations 1994
• Solving Nine Men's Morris 1996
• 象棋實用殘局知識庫系統之設計與製作 1999
  • http://140.134.132.124/dspace/bitstream/2377/2611/1/ce07ncs001999000015.pdf
• 象棋殘局回溯分析演算法之實作與評估 1999
  • http://140.134.132.124/dspace/bitstream/2377/2794/1/ce07ncs001999000050.pdf
• Endgame databases and efficient index schemes 1999
• Knowledgeable encoding and querying of endgame databases 1999
• Large endgame databases with limited memory space 2000
• Awari Retrograde Analysis 2000
• Space-efficient Indexing of Endgame Tables for Chess 2000
• Construction of Chinese Chess Endgame databases by Retrograde Analysis 2000
• Computer Analysis of Some Chinese Chess Endgames
• Parallel Retrograde Analysis on Different Architecture 2001
• A Memory Efficient Retrograde Algorithm and Its Application To Chinese Chess Endgames 2001
• Fast, memory-efficient retrograde algorithms 2001
• Solving Chinese chess endgames by database construction 2001
• Exploring the Computational Limits of Large Exhaustive Search Problems 2002
• Verification of Endgame Databases 2002
• Indefinite Sequence of Moves in Chinese Chess Endgames 2002
  • improved version: Checking Indefinitely in Chinese Chess Endgames 2004
• Building the Checkers 10-piece endgame databases 2003
• Solving the game of awari using parallel retrograde analysis 2003
• Knowledge Discovery in Endgame Databases
• Building Chess Endgame Databases for Positions with many Pieces using A-priori Information
• An External-Memory Retrograde Analysis Algorithm 2004
• Rule-tolerant Verification Algorithms for Complete Chinese Chess Endgames 2004
• Partial Information Endgame Databases 2005
• Formal Verification of Chess Endgame Databases 2005
• The Nature of Retrograde Analysis for Chinese Chess 2006
• A Retrograde Approximation Algorithm for One-Player Can't Stop 2006
• Chess Endgame Data Assurance 2006
• A Retrograde Approximation Algorithm for Two-Player Can't Stop 2007
• Knowledge Inferencing on Chinese Chess Endgames, 2008
• Conflict Resolution of Chinese Chess Endgame Knowledge Base 2009

• On Numbers and Endgames: Combinatorial Game Theory in Chess Endgames
• Multilinear Algebra and Chess Endgames
• Generation and compression of endgame tables in chess with fast random access using OBDDs
• Aggregating Consistent Endgame Knowledge in Chinese Chess 2012
• Multilevel Inference in Chinese Chess Endgame Knowledge Bases 2013

self-play, test

• [A Test Suite for Chess Programs]
• Report on the Symposium Man vs. Machine: The Experiment
• A new self-play experiment in computer chess.
• A Shogi-Computer Test Set
• DARKTHOUGHT goes deep
• Knowledge-based Test Suites for the Evaluation of Chess Strength

opening

• The Amateur Book-Opening Routine 1990
• A method of applying opening book data to non-recorded position 1996
• Improving opening book performance through modeling of chess opponents 1996
• Toward Opening Book Learning 1999
• Book Learning - a methodology to automatically tune an opening book 1999
• Strategies for the Automatic Construction of Opening Books 2000
• Planning to Guide Opening and Middle Game Play in Shogi 2000
• Position-Value Representation in Opening Books 2003
• Generating an Opening Book for Amazons 2004
• Innovative Opening-Book Handling 2005
• 中国象棋计算机博弈开局库研究与设计 2007
• Study on Loop Problem in Opening Database for Chinese Chess Programs 2007
• 適用於象棋開局庫之工作層級極小極大化搜尋 2011

parallel

• Tree partitioning
• A lockless transposition table implementation for parallel search

• distributed
  • A Fully Distributed Chess Program 1991 {28/64}
  • A Distributed Model for Game Computing
  • The ChessBrain Project
• multiprocessor (shared memory)
  • Improved parallel alpha-beta search 1986 {5.7/9}
  • The DTS high-performance parallel tree search algorithm 1994 {11/16}
  • Massively Parallel Chess 1994
  • The ABDADA Distributed Minimax Search Algorithm 1996 {10/16,13/24,15/32}
  • Parallel Alpha-Beta Pruning of Game Decision Trees: A Chess Implementation 1999 {9/16}
  • Parallel Alpha-Beta Search on Shared Memory Multiprocessors 2001 (thesis)
• A Taxonomy Of Parallel Game-Tree Search Algorithms 1996
• Generating Chess Moves using Parallel Virtual Machine 1996
• APHID 1996
  • Asynchronous Parallel Game-Tree Search 1999 {8/16,16/32,16/64}
  • Asynchronous Parallel Game-Tree Search(thesis)
  • APHID Parallel Game-Tree Search Library
• TDS transposition driven scheduling
  • single agent 1999
    • Tranposition Table Driven Work Scheduling in Distributed Search
    • Wide-Area Transposition-Driven Scheduling
    • A Performance Analysis of Transposition-Table-Driven Work Scheduling in Distributed Search
  • two player 2002
    • Distributed Game-Tree Search Using Transposition Table Driven Work Scheduling
    • Transposition Table Driven Scheduling for Two-Player Games, thesis
• programs
  • KnightCap Parallel Chess Program
  • The *Socrates Massively Parallel Chess Program
  • The Cilkchess Parallel Chess Program
  • SIRIUS: the MacCHESS Linux Cluster
  • 象棋世家遠端運算及多機聯算引擎
• misc
  • book, Parallel Algorithms
  • Creating Chess-Playing Artificial Neural Networks with Distributed Evolutionary Algorithms
  • Cilk Papers

learning and pattern

• GENETIC OTHELLO
• KnightCap
• Game Learning
• Reinforcement Learning: An Introduction
• Machine Learning in Games
• How Hard is the Correct Coding of An Easy Endgame
• meta game
  • Multigame - A Very High Level Language for Describing Board Games
• Learning from Perfection: A Data Mining Approach to Evaluation Function Learning in Awari
• MOUSE: A Self-teaching Algorithm that Achieved Master-Strength at Othello
• First Results from Using Temporal Difference Learning in Shogi
• Improving heuristic mini-max search by supervised learning
• Knowledge discovery in Deep Blue 1999
• Temporal difference learning for heuristic search and game playing 1999
• Learning Time Allocation Using Neural Networks
• Temporal Difference Learning in Chinese Chess
• Strategy and board game programming: Tuning the evaluation function

未分類

• Paul Verhelst's collection of [Computer Chess Programming]
  • Computer Chess Programming
• Portable Game Notation Specification and Implementation Guide
• Computer chess wikipage
• guide to Endgames Tablebase
• http://www.cs.ualberta.ca/~tony/
• http://www.cs.ualberta.ca/~tony/ICCA/
• http://brick.bitpit.net/mscp/
• Chess Programming Theory
• http://www.tim-mann.org/chess.html
• David Dowe's chess and games page
• Bibliography on Machine Learning in Strategic Game Playing
• http://www.gameai.com/ai.html
• compression
  • Data compression using an intelligent generator: the storage of chess games as an example
  • Compressing databases down to micro size 1986
  • Compressing a chess-endgame database 1989
  • Endgame database compression for humans and machines 1990
  • Compressing chess games with the help of a fast deterministic chess program 1990
  • An Approach to Data Compression in Coding Chess Positions 1993
• Deep Blue
  • IBM's Deep Blue Chess Grandmaster Chips 1999
  • Deep Blue: Playing Chess at Another Level
  • Designing a Single Chip Chess Grandmaster While Knowing Nothing About Chess
  • Deep Blue's Hardware-Software Synergy
  • Feng-hsiung Hsu. Large Scale Parallelization of Alpha-Beta Search: An Algorithmic and Architectural Study with Computer Chess. PhD thesis, Carnegie-Mellon University 1990
  • Deep Blue, Artificial Intelligence, Volume 134
  • Deep Blue system overview
• VLSI/FPGA
  • All the Right Moves: A VLSI Architecture for Chess (ACM Distinguished Dissertation)
  • An FPGA Move Generator for the Game of Chess
    • Master's thesis
    • [on IEEE CICC], [on ICGA]
    • VHDL source code of hardware move generator
  • A Shogi Processor with a Field Programmable Gate Array
  • Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program
  • A Shogi Processor with a Field Programmable Gate Array
  • The Design and Implementation of Hardware Acceleration for Chinese Chess
• Exploring the Computational Limits of Large Exhaustive Search Problems
• XML
  • Checkmate XML
  • PGNXML Standard for Chess Notation
  • XmlChess
  • Chess Markup Language (ChessML)
  • Caxton XML Schema (October 2003)
  • ChessGML
    • ChessGML to SVG
  • XiangQi XML
• Abstracting Knowledge from Annotated Chinese Chess Game Records 2006
• Plays, Values, Analysis and the Complexity of Chinese Chess
• 向中国象棋冠军发起挑战
• 中国象棋计算机博弈关键技术分析
• 一种基于DSP和FPGA的博弈硬件方案实现
• Xiangqi and Combinatorial Game Theory

papers

• A group-theoretic Zobrist Hash Function
• Machine Learning In Computer Chess: The Next Generation 1996
• Searching for Solutions in Games and Artificial Intelligence (thesis)
• Using Experience-Based Learning in Game Playing
• Hash functions for binary and ternary words
• Improving Heuristic Mini-Max Search by Supervised Learning
• The Future of Chess-Playing Technologies and the Significance of Kasparov Versus Deep Blue
• Knowledge Discovery in Chess Databases: A Research Proposal
• A Comparison of Algorithms for Multi-player Games
• Board Maps and Hill-Climbing for Opening and Middle Game Play in Shogi
• Optimal Play against Best Defence: Complexity and Heuristics
• Plausible Move Generation Using Move Merit Analysis with Cut-Off Thresholds in Shogi
• SUPER-SOMA - Solving Tactical Exchanges in Shogi without Tree Searching
• Solving Kriegspiel-Like Problems: Examining Efficient Search Methods
• Using Time Wisely, Revisited
• Propagating Distributions Up Directed Acyclic Graphs
• The Design and Implementation of the Rookie 2.0 Chess Playing Program (thesis)
• The Evolution of Mulan: Some Studies in Game-Tree Pruning and Evalution Functions in the Game of Amazons
• 網路應用於電腦象棋學習系統之設計與製作
• 中国象棋机器博弈的时间自适应分配策略研究 2006

personal publication

• http://www.xs4all.nl/~aske/pubs.html
• http://www.cs.biu.ac.il/~davoudo/pubs.html
• Ernst A. Heinz
• Dennis M. Breuker
  • Memory versus Search in Games (Ph.D. thesis)
• T.A(Tony) Marsland (-1990)
• T.A(Tony) Marsland (1990-)
• Robert Hyatt
• Michael Buro
• John W. Romein
• Jean-Christophe WEILL
• Danny Kopec (-1998)
• Reijer Grimbergen

paper collection

• http://digilander.libero.it/gargamellachess/papers.htm
• paper collected by Nicola Rizzuti
• Ernst A. Heinz, [(DarkThought), ``Scalable Search in Computer Chess]
• dotbishop
• Games of No Chance
• More Games of No Chance
• ICCA/ICGA contents