 | A major contributor to this article appears to have a close connection with its subject.(June 2014) |
Albert Lindsey Zobrist (born February 27, 1942) is an American computer scientist, games researcher, and inventor of the famous Zobrist Hashing, which was published in 1970. [1] He is further author of the first Go program in 1968 as part of his PhD Thesis on pattern recognition at the Computer Science Department of the University of Wisconsin. [2]
Albert Zobrist received his Bachelor of Science in Mathematics at the Massachusetts Institute of Technology and a Masters in Mathematics and PhD in Computer Science from the University of Wisconsin–Madison.
While affiliated with the University of Southern California and the Jet Propulsion Laboratory, Zobrist researched on computer chess, and was along with Frederic Roy Carlson and Charles Kalme co-author of the chess programs USC CP and Tyro, [3] participating at the ACM North American Computer Chess Championships (NACCC) in 1977. [4]
Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The game of Go has been a fertile subject of artificial intelligence research for decades, culminating in 2017 with AlphaGo Master winning three of three games against Ke Jie, who at the time continuously held the world No. 1 ranking for two years.
A transposition table is a cache of previously seen positions, and associated evaluations, in a game tree generated by a computer game playing program. If a position recurs via a different sequence of moves, the value of the position is retrieved from the table, avoiding re-searching the game tree below that position. Transposition tables are primarily useful in perfect-information games. The usage of transposition tables is essentially memoization applied to the tree search and is a form of dynamic programming.
James Reginald Cordy is a Canadian computer scientist and educator who is Professor Emeritus in the School of Computing at Queen's University. As a researcher he is most recently active in the fields of source code analysis and manipulation, software reverse and re-engineering, and pattern analysis and machine intelligence. He has a long record of previous work in programming languages, compiler technology, and software architecture.
Robert Morgan Hyatt is an American computer scientist and programmer. He co-authored the computer chess programs Crafty and Cray Blitz which won two World Computer Chess Championships in the 1980s. Hyatt was a computer science professor at the University of Southern Mississippi (1970–1985) and University of Alabama at Birmingham (1988–2016).
Barbara Liskov is an American computer scientist who has made pioneering contributions to programming languages and distributed computing. Her notable work includes the development of the Liskov substitution principle which describes the fundamental nature of data abstraction, and is used in type theory and in object-oriented programming. Her work was recognized with the 2008 Turing Award, the highest distinction in computer science.
Michael Randolph Garey is a computer science researcher, and co-author of Computers and Intractability: A Guide to the Theory of NP-completeness. He and Johnson received the 1979 Frederick W. Lanchester Prize from the Operations Research Society of America for the book. Garey earned his PhD in computer science in 1970 from the University of Wisconsin–Madison. He was employed by AT&T Bell Laboratories in the Mathematical Sciences Research Center from 1970 until his retirement in 1999. For his last 11 years with the organization, he served as its director. His technical specialties included discrete algorithms and computational complexity, approximation algorithms, scheduling theory, and graph theory. From 1978 until 1981 he served as Editor-in-Chief of the Journal of the Association for Computing Machinery. In 1995, Garey was inducted as a Fellow of the Association for Computing Machinery.
Zobrist hashing is a hash function construction used in computer programs that play abstract board games, such as chess and Go, to implement transposition tables, a special kind of hash table that is indexed by a board position and used to avoid analyzing the same position more than once. Zobrist hashing is named for its inventor, Albert Lindsey Zobrist. It has also been applied as a method for recognizing substitutional alloy configurations in simulations of crystalline materials.
William F. (Bill) Opdyke is an American computer scientist, and enterprise architect at JPMorgan Chase, known for his early work on code refactoring.
Board representation in computer chess is a data structure in a chess program representing the position on the chessboard and associated game state. Board representation is fundamental to all aspects of a chess program including move generation, the evaluation function, and making and unmaking moves as well as maintaining the state of the game during play. Several different board representations exist. Chess programs often utilize more than one board representation at different times, for efficiency. Execution efficiency and memory footprint are the primary factors in choosing a board representation; secondary considerations are effort required to code, test and debug the application.
Edmund Melson Clarke, Jr. was an American computer scientist and academic noted for developing model checking, a method for formally verifying hardware and software designs. He was the FORE Systems Professor of Computer Science at Carnegie Mellon University. Clarke, along with E. Allen Emerson and Joseph Sifakis, received the 2007 ACM Turing Award.
Ronald Fagin is an American mathematician and computer scientist, and IBM Fellow at the IBM Almaden Research Center. He is known for his work in database theory, finite model theory, and reasoning about knowledge.
Shang-Hua Teng is a Chinese-American computer scientist. He is the Seeley G. Mudd Professor of Computer Science and Mathematics at the University of Southern California. Previously, he was the chairman of the Computer Science Department at the Viterbi School of Engineering of the University of Southern California.
Johannes Gehrke is a German computer scientist and the director of Microsoft Research in Redmond and CTO and Head of Machine Learning for the Microsoft Teams Backend. He is an ACM Fellow, an IEEE Fellow, and the recipient of the 2011 IEEE Computer Society Technical Achievement Award. From 1999 to 2015, he was a faculty member in the Department of Computer Science at Cornell University, where at the time of his leaving he was the Tisch University Professor of Computer Science.
Constantinos Daskalakis is a Greek theoretical computer scientist. He is a professor at MIT's Electrical Engineering and Computer Science department and a member of the MIT Computer Science and Artificial Intelligence Laboratory. He was awarded the Rolf Nevanlinna Prize and the Grace Murray Hopper Award in 2018.
Michael David Mitzenmacher is an American computer scientist working in algorithms. He is Professor of Computer Science at the Harvard John A. Paulson School of Engineering and Applied Sciences and was area dean of computer science July 2010 to June 2013. He also runs My Biased Coin, a blog about theoretical computer science.
Lawrence Hugh Landweber is John P. Morgridge Professor Emeritus of Computer Science at the University of Wisconsin–Madison.
In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive or operations. It was first studied in the form of Zobrist hashing for computer games; later work by Carter and Wegman extended this method to arbitrary fixed-length keys. Generalizations of tabulation hashing have also been developed that can handle variable-length keys such as text strings.
Mary Kenneth Keller, B.V.M. was an American Roman Catholic religious sister, educator and pioneer in computer science. She was the first person to earn a Ph.D. in computer science in the United States. Keller and Irving C. Tang were the first two recipients of computer science doctorates.
Demetri Terzopoulos is a Distinguished Professor and Chancellor's Professor of Computer Science in the Henry Samueli School of Engineering and Applied Science at the University of California, Los Angeles, where he directs the UCLA Computer Graphics & Vision Laboratory.
Carla Pedro Gomes is a Portuguese-American computer scientist and professor at Cornell University. She is the founding Director of the Institute for Computational Sustainability and is noted for her pioneering work in developing computational methods to address challenges in sustainability. She has conducted research in a variety of areas of artificial intelligence and computer science, including constraint reasoning, mathematical optimization, and randomization techniques for exact search methods, algorithm selection, multi-agent systems, and game theory. Her work in computational sustainability includes ecological conservation, rural resource mapping, and pattern recognition for material science.
| General | |
|---|---|
| National libraries | |
| Scientific databases | |