Changes

The strength of a chess program depends on many things, the quality and efficiency of the [[Algorithms|algorithms]] involved to determine the best move of a position, the balance of the so called [[Search|search]] versus [[Knowledge|knowledge tradeoff]] to [[Evaluation|evaluate]] or compare [[Leaf Node|leaf nodes]] of a [[Search Tree|search tree]], how to shape that tree and to propagate a [[Score|score]] up to the [[Root|root]], and [[Time Management|time management]], that is how to allocate time for searching a move under time control requirements. Time used is roughly proportional to the number of visited [[Node|nodes]] of the common [[Depth-First|depth-first search]] inside an [[Iterative Deepening|iterative deepening frame]], which [https://en.wikipedia.org/wiki/Exponential_growth grows exponentially] by its [[Branching Factor#EffectiveBranchingFactor|effective branching factor]] raised to the power of [[Depth|search depth]]. Playing strength might be improved over the (playing) time due to [[Learning|learning algorithms]].

* [[Matej Guid#ComputerAnalysis|Matej Guid - Computer Analysis of World Chess Champions]]

* [[Jean-Marc Alliot#WhoistheMaster|Jean-Marc Alliot - Who is the Master?]]

* [[Automated Tuning]]

* [[Depth]]