Changes

[[Alpha-Beta]] F2 and [[Iterative Search|Iterative Solution]] <ref>[[Donald Knuth]], [http://www.informatik.uni-trier.de/~ley/pers/hd/m/Moore:Ronald_W= Ronald W. Moore] ('''1975'''). ''An Analysis of Alpha-Beta Pruning''. [https://en.wikipedia.org/wiki/Artificial_Intelligence_%28journal%29 Artificial Intelligence], Vol. 6, No. 4, pp 293–326. Reprinted in [[Donald Knuth]] ('''2000'''). ''[http://www-cs-faculty.stanford.edu/~uno/aa.html Selected Papers on Analysis of Algorithms]''. [http://web.stanford.edu/group/cslipublications/cslipublications/site/CSIN.shtml CSLI lecture notes series] 102, ISBN 1-57586-212-3, [http://www-public.it-sudparis.eu/~gibson/Teaching/CSC4504/ReadingMaterial/KnuthMoore75.pdf pdf]</ref>* [http://chessprogramming.wikispaces.com/space/showimage/[knuth-alpha-beta.JPG |Knuth and Moore‘s famous Function F2, aka AlphaBeta]]* [http://chessprogramming.wikispaces.com/space/showimage/[knuth-iterative.JPG |Knuth already introduced an iterative solution]]