Changes

the fundamental unit in [https://en.wikipedia.org/wiki/Graph_theory graph theory] and, applied to [https://en.wikipedia.org/wiki/Computer_science computer science], basic unit to structure and link devices of a [https://en.wikipedia.org/wiki/Computer_network network] as well as [[Data|data]], such as items of a [[Linked List|linked list]] or [https://en.wikipedia.org/wiki/Tree_%28data_structure%29 tree structure]. This page is about the '''node''' of the [[Search Tree|search tree]] in the game of chess, which represents the alternating white and black to move [[Chess Position|positions]] and keeps its state dependent on the [https://en.wikipedia.org/wiki/Tree_traversal tree traversal]. Inside a [[Depth-First|depth-first]] search, nodes are usually counted at top of the [[Recursion|recursive]] search routine, i.e. for the purpose to determine [[Nodes per secondSecond|nodes per second]]. The [[Moves|move]] is the [https://en.wikipedia.org/wiki/Directed_graph directed edge] which connects an ordered pair of nodes or positions.

* [[Nodes per secondSecond]]