Alexander Brudno

Alexander Brudno (Aleksandr L'vovich Brudno) ( _ru. Александр Львович Брудно) (born 1918) is a Russian computer scientist, best known for fully describing the alpha-beta (α-β) search algorithm.cite web
author = [http://www.cs.ualberta.ca/~tony/ Marsland, T.A.]
title = Computer Chess Methods (PDF) from Encyclopedia of Artificial Intelligence. S. Shapiro (editor)
publisher = J. Wiley & Sons
date = May 1987
pages = 159-171
url = http://www.cs.ualberta.ca/~tony/OldPapers/encyc.mac.pdf
accessdate = 2006-12-21]

Biography

Brudno developed the "mathematics/machine interface" for the [http://www.computer-museum.ru/english/m2.htm M-2] computer constructed in 1952 at the Krzhizhanovskii laboratory of the Institute of Energy of the Russian Academy of Sciences in the Soviet Union.E.M. Landis, I.M. Yaglom, "Remembering A.S. Kronrod", English translation by Viola Brudno. [http://www.cs.purdue.edu/homes/wxg/ W. Gautschi] (ed.) [written for "Uspekhi Matematicheskikh Nauk", English publication "Math. Intelligencer" (2002), 22-30] , available at Stanford University School of Engineering [http://sccm.stanford.edu/pub/sccm/sccm00-01.ps.gz SCCM-00-01] (PostScript). Retrieved on 19 December, 2006] cite web
author = [http://www.computer-museum.ru/english/index.htm Russian Virtual Computer Museum]
title = The Fast Universal Digital Computer M-2
date = 1997-2006
url = http://www.computer-museum.ru/english/m2.htm
accessdate = 2006-12-20] He was a great friend of Alexander Kronrod.

Brudno's work on alpha-beta was published in 1963 in Russian and English.

The algorithm was used in computer chess program written by Georgy Adelson-Velsky and others at the Institute for Theoretical and Experimental Physics (ITEF or ITEP). According to Monty Newborn and the Computer History Museum, the algorithm was used later in Kaissa the world computer chess champion in 1974.

Early alpha-beta

Allen Newell and Herbert Simon who used what John McCarthy calls an "approximation"cite web
author = McCarthy, John
title = Human Level AI Is Harder Than It Seemed in 1955
date = LaTeX2HTML 27 November, 2006
url = http://www-formal.stanford.edu/jmc/slides/wrong/wrong-sli/wrong-sli.html
accessdate = 2006-12-20] in 1958 wrote that alpha-beta "appears to have been reinvented a number of times".cite journal
author=Newell, Allen and Herbert A. Simon
title=Computer Science as Empirical Inquiry: Symbols and Search
journal=Communications of the ACM, Vol. 19, No. 3
date=March 1976
url=http://archive.computerhistory.org/projects/chess/related_materials/text/2-3.Computer_science_as_empirical_inquiry/2-3.Computer_science_as_empirical_inquiry.newell_simon.1975.ACM.062303007.pdf
accessdate=2006-12-21] Arthur Samuel had an early version and Richards, Hart, Levine and/or Edwards found alpha-beta independently in the United States.cite web
author = Richards, D.J. and Hart, T.P.
title = The Alpha-Beta Heuristic (AIM-030)
publisher = Massachusetts Institute of Technology
date = 4 December, 1961 to 28 October, 1963
url = http://hdl.handle.net/1721.1/6098
accessdate = 2006-12-21] Fact|date=February 2007 McCarthy proposed similar ideas during the Dartmouth Conference in 1956 and suggested it to a group of his students including Alan Kotok at MIT in 1961.cite web | last=Kotok | first=Alan | title=MIT Artificial Intelligence Memo 41 | date=XHTML 3 December, 2004 | url=http://www.kotok.org/AI_Memo_41.html | accessdate=2006-07-01] Donald Knuth and Ronald W. Moore refined the algorithm In 1975* cite journal
author = Knuth, D. E., and Moore, R. W.
title = An Analysis of Alpha-Beta Pruning
journal = Artificial Intelligence Vol. 6, No. 4
date = 1975
pages = 293–326
id =
accessdate = :* Reprinted as Chapter 9 in cite book
last = Knuth
first = Donald E.
title = Selected Papers on Analysis of Algorithms
year = 2000
publisher = Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102
url = http://www-cs-faculty.stanford.edu/~knuth/aa.html
id = ISBN 1-57586-212-3] cite journal
author=Abramson, Bruce
title=Control Strategies for Two-Player Games
journal=ACM Computing Surveys, Vol. 21, No. 2
date=June 1989
url=http://www.engr.uconn.edu/~acr/Courses/cse269-fa03/abra.pdf
accessdate=2006-12-21
format=dead link|date=June 2008 – ^{[http://scholar.google.co.uk/scholar?hl=en&lr=&q=author%3A+intitle%3AControl+Strategies+for+Two-Player+Games&as_publication=ACM+Computing+Surveys%2C+Vol.+21%2C+No.+2&as_ylo=&as_yhi=&btnG=Search Scholar search]} ] and it continued to be advanced.

ee also

*Computer chess
*Minimax

Notes

References

* cite web
author = Gift of [http://www.cs.mcgill.ca/~newborn/ Monroe Newborn]
title = Brudno in Moscow
publisher = Computer History Museum accession number 102645383
date = 1980
url = http://www.computerhistory.org/chess/full_record.php?iid=stl-430b9bbe49333
accessdate = 2006-12-25
* cite journal
last = Brudno
first = A.L.
title = Bounds and valuations for shortening the search of estimates
journal = Problemy Kibernetiki (10) 141–150 and Problems of Cybernetics (10) 225–241
date = 1963
url =
id =
accessdate =

External links

*Handwritten [http://www.ershov.ras.ru/archive/eaindex.asp?did=6014&lang=2 letter (12.04.1971)] and [http://www.ershov.ras.ru/archive/eaindex.asp?did=6125&lang=2 postcard (19.11.1971)] from Brudno to A. P. Ershov. en icon ru icon