Jay_Scott - peregrineshahin/ChessProgrammingWiki GitHub Wiki
title: Jay Scott
an American mathematician with expertise in machine learning who works for The Math Forum at Drexel University in Philadelphia [2]. He maintains the satirist.org websites [3], including Machine Learning in Games, where he describes programs relying on heuristic search algorithms, genetic algorithms, neural networks, and temporal differences. Jay Scott was an early GNU Chess contributor, mentioned as co-author in the ACM 1987 booklet [4]. He is further author of the experimental chess program Kon to study automated learning of search control, which used a breadth-first search and kept the entire tree in memory [5].
- Re: Genetic Algorithms for Chess Evaluation Functions by Jay Scott, rgcc, July 01, 1996
- Re: Gillgasch elevated/CBR Technology by Jay Scott, rgcc, March 07, 1997
- playing style from search (was Re: Junior's long lines) by Jay Scott, CCC, December 29, 1997
- overlapping tablebase lookup by Jay Scott, CCC, February 09, 1999
External Links
References
- ↑ Jay Scott at satirist.org, self portrait, January 2000
- ↑ The Math Forum @ Drexel University
- ↑ Jay Scott at satirist.org
- ↑ The ACM's Eighteenth North American Computer Chess Championship from The Computer History Museum, as pdf
- ↑ playing style from search (was Re: Junior's long lines) by Jay Scott, CCC, December 29, 1997