Dynamic Move Chains - a Forward Pruning Approach to Tree Search in Computer Chess

@article{Greer2014DynamicMC,
  title={Dynamic Move Chains - a Forward Pruning Approach to Tree Search in Computer Chess},
  author={Kieran R. C. Greer},
  journal={ArXiv},
  year={2014},
  volume={abs/1403.0778}
}
This paper proposes a new mechanism for pruning a search game-tree in computer chess. The algorithm stores and then reuses chains or sequences of moves, built up from previous searches. These move sequences have a built-in forward-pruning mechanism that can radically reduce the search space. A typical search process might retrieve a move from a Transposition Table, where the decision of what move to retrieve would be based on the position itself. This algorithm stores move sequences based on… 

Figures, Tables, and Topics from this paper