Arthur Samuel (computer scientist)

Biography

Samuel was born on December 5, 1901, in Emporia, Kansas, and graduated from the College of Emporia in Kansas in 1923. After the war he moved to the University of Illinois at Urbana–Champaign to become a Professor of Electrical Engineering, where he initiated the ILLIAC project, but left before its first computer was complete.

Samuel went to IBM in Poughkeepsie, New York, in 1949, where he would conceive and carry out his most successful work. He is credited with one of the first software hash tables, and influencing early research in using transistors for computers at IBM. At IBM he made the first checkers program on IBM's first commercial computer, the IBM 701. The program was a sensational demonstration of the advances in both hardware and skilled programming and caused IBM's stock to increase 15 points overnight. His pioneering non-numerical programming helped shape the instruction set of processors, as he was one of the first to work with computers on projects other than computation. He was known for writing articles that made complex subjects easy to understand. He was chosen to write an introduction to one of the earliest journals devoted to computing in 1953.

In 1966, Samuel retired from IBM and became a professor at Stanford University, where he worked the remainder of his life. He worked with Donald Knuth on the TeX project, including writing some of the documentation. He continued to write software past his 88th birthday.

He was given the Computer Pioneer Award by the IEEE Computer Society in 1987. Samuel died of complications from Parkinson's disease on July 29, 1990.

Computer checkers (draughts) development

Samuel is most known within the AI community for his groundbreaking work in computer checkers in 1959, and seminal research on machine learning, beginning in 1949. He believed teaching computers to play games was very fruitful for developing tactics appropriate to general problems, and he chose checkers as it is relatively simple though has a depth of strategy. The main driver of the machine was a search tree of the board positions reachable from the current state. Since he had only a very limited amount of available computer memory, Samuel implemented what is now called alpha-beta pruning. Instead of searching each path until reaching the game's conclusion, Samuel developed a scoring function based on the position of the board at any given time. This function tried to measure the chance of winning for each side at the given position, taking into account elements such as the number of pieces on each side, the number of kings, and the proximity of pieces to being “kinged”. The program chose its move based on a minimax strategy, meaning it made the move that optimized the value of this function, assuming that the opponent was trying to optimize the value of the same function from its point of view.

Samuel also designed various mechanisms by which his program could become better. In what he called rote learning, the program remembered every position it had already seen, along with the terminal value of the reward function. This technique effectively extended the search depth at each of these positions. Samuel's later programs reevaluated the reward function based on input from professional games. He also had it play thousands of games against itself as another way of learning. With all of this work, Samuel's program reached a respectable amateur status and was the first to play any board game at this high a level. He continued to work on checkers until the mid-1970s, at which point his program achieved sufficient skill to challenge a respectable amateur.

Awards

• 1990. Founding Fellow of the Association for the Advancement of Artificial Intelligence
• 1987. Computer Pioneer Award. : For Adaptive non-numeric processing.

Selected works

• Computing bit by bit, or Digital computers made easy (1953). Proceedings of the Institute of Radio Engineers 41, 1223-1230.

:: Pioneer of machine learning. :: Reprinted with an additional annotated game in Computers and Thought, edited by Edward Feigenbaum and Julian Feldman (New York: McGraw-Hill, 1963), 71-105.

• 1983. First Grade TeX: A Beginner's TeX Manual. Stanford Computer Science Report STAN-CS-83-985 (November 1983). :: Senior member in TeX community.

References

References

1. John McCarthy. (1990). "In Memoriam ''Arthur Samuel: Pioneer in Machine Learning''". AAAI.
2. (6 April 2018). "1987 Computer Pioneer Award". Computer Society.
3. Samuel, Arthur L.. (May 2017). "Some Studies in Machine Learning Using the Game of Checkers". IBM Journal of Research and Development.
4. (1990). "Memorial Resolution: Arthur L. Samuel". [[Stanford University]] Historical Society.
5. "Arthur Samuel".
6. E. A. Weiss. (1992). "Arthur Lee Samuel (1901-90)". IEEE Annals of the History of Computing.
7. A. L. Samuel. (1953). "Computing Bit by Bit or Digital Computers Made Easy". Proceedings of the IRE.
8. Donald Knuth. (1990). "Arthur Lee Samuel, 1901-1990". TUGboat.
9. "Past recipients for Computer Pioneer Award". IEEE Computer Society.
10. Narvaez, Alfonso a. (1990-08-09). "Arthur Samuel, 88, Pioneer Researcher In Computer Science". The New York Times.
11. Richard Sutton. (May 30, 1990). "Reinforcement Learning: An Introduction". MIT Press.
12. Arthur, Samuel. (1959-03-03). "Some Studies in Machine Learning Using the Game of Checkers". IBM Journal of Research and Development.
13. Schaeffer, Jonathan. ''One Jump Ahead: Challenging Human Supremacy in Checkers'', 1997, 2009, Springer, {{ISBN. 978-0-387-76575-4. Chapter 6.
14. "Elected AAAI Fellows".