Difference between revisions of "Terminal Node"
GerdIsenberg (talk | contribs) (Created page with "'''Home * Search * Node * Terminal Node''' '''Terminal nodes''' are leaf nodes with a fixed, application-dependent value (e.g.,...") |
GerdIsenberg (talk | contribs) |
||
| Line 1: | Line 1: | ||
'''[[Main Page|Home]] * [[Search]] * [[Node]] * Terminal Node''' | '''[[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 | + | '''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 Evaluation#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. | 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. | ||
| Line 8: | Line 8: | ||
* [[Checkmate]] | * [[Checkmate]] | ||
* [[Draw]] | * [[Draw]] | ||
| − | * [[Draw | + | * [[Draw Evaluation]] |
* [[Leaf Node]] | * [[Leaf Node]] | ||
* [[Interior Node]] | * [[Interior Node]] | ||
Latest revision as of 16:05, 16 May 2018
Home * Search * Node * Terminal Node
Terminal nodes are leaf nodes with a fixed, application-dependent value (e.g., win, loss, draw). Thus, nodes representing mate or stalemate positions, which have per game definition no more child nodes, since there are no legal moves. If the root becomes a terminal node, the game is finished. That virtually also applies for three-fold repetitions, fifty-move rule and draws by 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 may consider nodes where a cycle occurred (repetition but not yet necessarily three-fold) terminal as well, similar for nodes, where interior node recognizers detect a node state (e.g., a table base draw) with no need to search it further.
