FACTOID # 80: America puts many more of its citizens in prison than any other nation.
 
 Home   Encyclopedia   Statistics   Countries A-Z   Flags   Maps   Education   Forum   FAQ   About 
 
 
 
WHAT'S NEW
RECENT ARTICLES
More Recent Articles »
 

SEARCH ALL

FACTS & STATISTICS    Advanced view

Search encyclopedia, statistics and forums:

 

 

(* = Graphable)

 

 


Encyclopedia > Aleksandr Brudno

Aleksandr L'vovich Brudno (Alexander Lvovich Brudno) (Russian: Александр Львович Брудно) is a Russian computer scientist, best known for fully describing the alpha-beta (α-β) search algorithm.[1] Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. ... Alpha-beta pruning is a search algorithm that reduces the number of nodes that need to be evaluated in the search tree by the minimax algorithm. ... In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. ...


Brudno developed the "mathematics/machine interface" for the 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.[2][3] He was a great friend of Aleksandr Semenovich Kronrod. Brudno's work on alpha-beta was published in 1963 in Russian and English. The algorithm was used in computer chess program(s)[citation needed] written by Georgy Adelson-Velsky and others at the Institute for Theoretical and Experimental Physics (ITEF or ITEP) and later in Kaissa. 1952 (MCMLII) was a Leap year starting on Tuesday (link will take you to calendar). ... Russian Academy of Sciences: main building Russian Academy of Sciences (Росси́йская Акаде́мия Нау́к) is the national academy of Russia. ... Aleksandr (Alexander) Semenovich Kronrod (Russian Александр Семёнович Кронрод) (October 22, 1921 – October 6, 1986) was a Russian mathematician and computer scientist, best known for the Gauss-Kronrod quadrature which he published in 1964. ... 1963 (MCMLXIII) was a common year starting on Tuesday (the link is to a full 1963 calendar). ... Georgy Maximovich Adelson-Velsky (Russian: Гео́ргий Макси́мович Адельсо́н-Ве́льский; name is sometimes transliterated as Georgii Adelson-Velskii), (b. ... The entrance to ITEP (?) ITEP (Institute for Theoretical and Experimental Physics; Russian Институт теоретической и экспериментальн&#1086... Kaissa (Russian: ) was a chess program developed in Soviet Union in the 1960s. ...


Allen Newell and Herbert Simon who used an early version about 1958 wrote that alpha-beta "appears to have been reinvented a number of times".[4] Arthur Samuels had an early version and Richards, Hart, Levine and/or Edwards found alpha-beta independently in the United States.[citation needed] John McCarthy proposed similar ideas during the Dartmouth Conference in 1956 and suggested it to a group of his students at MIT in 1961.[5] Donald Knuth and Ronald W. Moore refined the algorithm In 1975.[6][7] and it continued to be advanced. Allen Newell (March 19, 1927 - July 19, 1992) was a researcher in computer science and cognitive psychology at the RAND corporation and at Carnegie-Mellon’s School of Computer Science. ... Herbert Alexander Simon (June 15, 1916 – February 9, 2001) was an American political scientist specialized in the fields of cognitive psychology, computer science, public administration, economics, management, and philosophy of science and a professor, most notably, at Carnegie Mellon University. ... 1958 (MCMLVIII) was a common year starting on Wednesday of the Gregorian calendar. ... John McCarthy (born September 4, 1927, in Boston, Massachusetts, sometimes known affectionately as Uncle John McCarthy), is a prominent computer scientist who received the Turing Award in 1971 for his major contributions to the field of Artificial Intelligence. ... The Dartmouth Conference was the name of a conference organised by John McCarthy, in which he gathered together everyone who was interested in finding out about Artificial Intelligence (as it was then given its name). ... 1956 (MCMLVI) was a leap year starting on Sunday of the Gregorian calendar. ... 1961 (MCMLXI) was a common year starting on Sunday (the link is to a full 1961 calendar). ... Donald Knuth at a reception for the Open Content Alliance. ... 1975 (MCMLXXV) was a common year starting on Wednesday. ...


See also

Alpha-beta pruning is a search algorithm that reduces the number of nodes that need to be evaluated in the search tree by the minimax algorithm. ... Minimax (sometimes minmax) is a method in decision theory for minimizing the maximum possible loss. ... In computer science, a search algorithm, broadly speaking, is an algorithm that takes a problem as input and returns a solution to the problem, usually after evaluating a number of possible solutions. ...

Notes

  1. ^ Marsland, T.A. (May 1987). Computer Chess Methods (PDF) from Encyclopedia of Artificial Intelligence. S. Shapiro (editor) 159-171. J. Wiley & Sons. Retrieved on 2006-12-21.
  2. ^ E.M. Landis, I.M. Yaglom, Remembering A.S. Kronrod, English translation by Viola Brudno. W. Gautschi (ed.) [written for Uspekhi Matematicheskikh Nauk, English publication Math. Intelligencer (2002), 22-30], available at Stanford University School of Engineering SCCM-00-01 (PostScript). Retrieved on 19 December 2006
  3. ^ Russian Virtual Computer Museum (1997-2006). The Fast Universal Digital Computer M-2. Retrieved on 2006-12-20.
  4. ^ Newell, Allen and Herbert A. Simon (March 1976). "Computer Science as Empirical Inquiry: Symbols and Search". Communications of the ACM, Vol. 19, No. 3. Retrieved on 2006-12-21.
  5. ^ Kotok, Alan (XHTML 3 December 2004). MIT Artificial Intelligence Memo 41. Retrieved on 2006-07-01.
  6. ^ McCarthy, John (latex2html 27 November 2006). Human Level AI Is Harder Than It Seemed in 1955. Retrieved on 2006-12-20.
  7. ^ Abramson, Bruce (June 1989). "Control Strategies for Two-Player Games". ACM Computing Surveys, Vol. 21, No. 2. Retrieved on 2006-12-21.

2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... December 21 is the 355th day of the year (356th in leap years) in the Gregorian calendar. ... Yevgeniy Mikhailovich Landis (E.M. Landis, Russian Евгений Михайлович Ландис) ( ? – ? ) is a Russian mathematician. ... December 19 is the 353rd day of the year (354th in leap years) in the Gregorian calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... December 20 is the 354th day of the year (355th in leap years) in the Gregorian calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... December 21 is the 355th day of the year (356th in leap years) in the Gregorian calendar. ... December 3 is the 337th (in leap years the 338th) day of the year in the Gregorian calendar. ... 2004 (MMIV) was a leap year starting on Thursday of the Gregorian calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... July 1 is the 182nd day of the year (183rd in leap years) in the Gregorian Calendar, with 183 days remaining. ... November 27 is the 331st day (332nd on leap years) of the year in the Gregorian Calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... December 20 is the 354th day of the year (355th in leap years) in the Gregorian calendar. ... 2006 (MMVI) is a common year starting on Sunday of the Gregorian calendar. ... December 21 is the 355th day of the year (356th in leap years) in the Gregorian calendar. ...

References

  • Richards, D.J. and Hart, T.P. (4 December 1961 to 28 October 1963). The Alpha-Beta Heuristic (AIM-030). Massachusetts Institute of Technology. Retrieved on 2006-12-21.
  • Brudno, A.L. (1963). "Bounds and valuations for shortening the search of estimates". Problemy Kibernetiki (10) 141–150 and Problems of Cybernetics (10) 225–241.
  • Knuth, D. E., and Moore, R. W. (1975). "An Analysis of Alpha-Beta Pruning". Artificial Intelligence Vol. 6, No. 4: 293-326.
  • Reprinted as Chapter 9 in Knuth, Donald E. (2000). Selected Papers on Analysis of Algorithms. Stanford, California: Center for the Study of Language and Information - CSLI Lecture Notes, no. 102. ISBN 1-57586-212-3.

 
 

COMMENTARY     


Share your thoughts, questions and commentary here
Your name
Your comments

Want to know more?
Search encyclopedia, statistics and forums:
 


Lesson Plans | Student Area | Student FAQ | Reviews | Press Releases |  Feeds | Contact
The Wikipedia article included on this page is licensed under the GFDL.
Images may be subject to relevant owners' copyright.
All other elements are (c) copyright NationMaster.com 2003-5. All Rights Reserved.
Usage implies agreement with terms, 1022, m