Last modified: Sat Mar 15 23:10:51 2008
Page: http://www.csie.ntu.edu.tw/~r92030/chess/ref/links.pl
許多資料我有存一份下來, 若你需要的東西其所在網站消失, 且 google 找不到, 也許可以跟我聯絡.
I have copies of some following url contents. You may contact me if the data you want is disappeared.
chess
chinese chess
how to write chess program
chess engine interface
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
- A Minimax Algorithm Better than Alpha-Beta? No and Yes, 1995
- MTD(f)
- 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, PN2 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
- A Generalized Threats Search Algorithm, 2003
- Graph History Interaction Problem (GHI)
- A New Approach to Draw Detection by Move Repetition in Computer Chess Programming
- Variable Depth Search
Search Heuristic/Moves Ordering
Pruning
Evaluation function
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
- 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
self-play, test
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
parallel
learning and pattern
未分類
papers
personal publication
paper collection