25,161
edits
Changes
no edit summary
'''[[Main Page|Home]] * [[Search]] * [[Node]] * Terminal Node'''
'''Terminal nodes''' are [[Leaf Node|leaf nodes]] with a fixed, application-dependent [[Score|value]] (e.g., win, loss, [[Draw|draw]]). Thus, nodes representing [[Checkmate|mate]] or [[Stalemate|stalemate]] positions, which have per [[Chess Game|game definition]] no more child nodes, since there are no [[Legal Move|legal moves]]. If the [[Root|root]] becomes a terminal node, the game is [[Chess Game#endofgame|finished]]. That virtually also applies for [[Repetitions|three-fold repetitions]], [[Fifty-move Rule|fifty-move rule]] and [[Draw evaluationEvaluation#immediate|draws]] by [[Material#InsufficientMaterial|insufficient material]], despite strict interpretation of the rules requires a claim and an arbiter instance to finally declare them terminal.
In a wider sense, the search below the [[Root|root]] may consider nodes where a cycle occurred ([[Repetitions|repetition]] but not yet necessarily three-fold) terminal as well, similar for nodes, where [[Interior Node Recognizer|interior node recognizers]] detect a node state (e.g., a table base draw) with no need to search it further.
* [[Checkmate]]
* [[Draw]]
* [[Draw evaluationEvaluation]]
* [[Leaf Node]]
* [[Interior Node]]
