Difference between revisions of "Warren D. Smith"

From Chessprogramming wiki
Jump to: navigation, search
Line 6: Line 6:
 
under [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]</ref>.  
 
under [[Mathematician#RETarjan|Robert E. Tarjan]] and [[John H. Conway]] <ref>[https://genealogy.math.ndsu.nodak.edu/id.php?id=87407 The Mathematics Genealogy Project - Warren Smith]</ref>.  
 
He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS].  
 
He was affiliated with the [[Bell Laboratories|AT&T Bell Laboratories]], the [https://en.wikipedia.org/wiki/NEC_Corporation_of_America NEC Research Institute], [https://en.wikipedia.org/wiki/Princeton,_New_Jersey Princeton, New Jersey], where he wrote most of his papers during the 90s, and with [https://en.wikipedia.org/wiki/DIMACS DIMACS].  
His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics],  [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy].
+
His research interest covers the broad range of mathematics, physics, [https://en.wikipedia.org/wiki/Information_theory information theory], [https://en.wikipedia.org/wiki/Computer_science computer science] and [https://en.wikipedia.org/wiki/Politics politics], amongst other things on [[Algorithms|algorithms]], [https://en.wikipedia.org/wiki/Coding_theory coding theory], [https://en.wikipedia.org/wiki/Cryptography cryptography], [https://en.wikipedia.org/wiki/Combinatorics combinatorics], [https://en.wikipedia.org/wiki/Computational_complexity_theory computational complexity], [[Search|game tree search]], [https://en.wikipedia.org/wiki/Game_theory game theory], computer chess, [https://en.wikipedia.org/wiki/Quantum_mechanics quantum mechanics],  [https://en.wikipedia.org/wiki/Bayesian_statistics Bayesian statistics], [https://en.wikipedia.org/wiki/Range_voting range voting] and [https://en.wikipedia.org/wiki/Direct_democracy direct democracy]. With the advent of [[Deep Learning|deep learning]] [[Monte-Carlo Tree Search|MCTS]] chess engines after the [[AlphaZero]] publications, Warren D. Smith discussed [[Leela Chess Zero]] as well as [[Stockfish]] topics in [[Computer Chess Forums|LCZero]] and [[Computer Chess Forums|FishCooking]] forums.
  
 
=Test Suite for Chess Programs=
 
=Test Suite for Chess Programs=
Line 58: Line 58:
 
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Lower bounds on maximal determinants of binary matrices via the probabilistic method''. [https://arxiv.org/abs/1402.6817 arXiv:1402.6817]
 
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Lower bounds on maximal determinants of binary matrices via the probabilistic method''. [https://arxiv.org/abs/1402.6817 arXiv:1402.6817]
 
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Probabilistic lower bounds on maximal determinants of binary matrices''. [https://en.wikipedia.org/wiki/Australasian_Journal_of_Combinatorics Australasian Journal of Combinatorics], Vol. 66, [https://arxiv.org/abs/1501.06235 arXiv:1501.06235]
 
* [[Mathematician#Brent|Richard P. Brent]], [https://dblp.uni-trier.de/pers/hd/o/Osborn:Judy=anne_H= Judy-anne H. Osborn], [[Warren D. Smith]] ('''2016'''). ''Probabilistic lower bounds on maximal determinants of binary matrices''. [https://en.wikipedia.org/wiki/Australasian_Journal_of_Combinatorics Australasian Journal of Combinatorics], Vol. 66, [https://arxiv.org/abs/1501.06235 arXiv:1501.06235]
+
 
 +
=Forum Posts=
 +
==2018==
 +
* [https://groups.google.com/d/msg/lczero/dU8v637v2Ig/C1-e5JNKCgAJ Re: Low draw rate in training games/data] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], April 14, 2018
 +
* [https://groups.google.com/d/msg/lczero/EGcJSrZYLiw/netJ4S38CgAJ use multiple neural nets?] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], December 25, 2018 » [[Leela Chess Zero]]
 +
==2019==
 +
* [https://groups.google.com/d/msg/lczero/CrMiK3OR1og/mcFd0NDKDQAJ "boosting" endgames in leela training? Simple change to learning process proposed: "forked" training games] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], January 03, 2019 » [[Leela Chess Zero]]
 +
* [https://groups.google.com/d/msg/lczero/I0lTgR-fFFU/NGC3kJDzAwAJ Michael Larabel benches lc0 on various GPUs] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], January 14, 2019 » [[Leela Chess Zero#Lc0|Lc0]], [[GPU]] <ref>[https://en.wikipedia.org/wiki/Phoronix_Test_Suite Phoronix Test Suite from Wikipedia]</ref>
 +
* [https://groups.google.com/d/msg/fishcooking/LEo3GSfeoqM/M1dLkoY3BAAJ TCEC 15 superfinal] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], May 15, 2019 » [[TCEC Season 15#Superfinal|TCEC Season 15 Sufi]]
 +
* [https://groups.google.com/d/msg/fishcooking/Ual8DTYpH0I/Ah6hDc-ZBQAJ zugzwang suggestion] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], September 15, 2019
 +
* [https://groups.google.com/d/msg/fishcooking/wOfRuzTSi_8/VgjN8MmSBQAJ high dimensional optimization] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], December 27, 2019 <ref>[[Mathematician#YDauphin|Yann Dauphin]], [[Mathematician#RPascanu|Razvan Pascanu]], [[Mathematician#CGulcehre|Caglar Gulcehre]], [[Mathematician#KCho|Kyunghyun Cho]], [[Mathematician#SGanguli|Surya Ganguli]], [[Mathematician#YBengio|Yoshua Bengio]] ('''2014'''). ''Identifying and attacking the saddle point problem in high-dimensional non-convex optimization''. [https://arxiv.org/abs/1406.2572 arXiv:1406.2572]</ref>
 +
==2020==
 +
* [https://groups.google.com/d/msg/fishcooking/DAWWlmP2OrQ/3w_KhoaUAAAJ underpromoting is worth how many elo?] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], March 08, 2020 » [[Promotions]]
 +
* [https://groups.google.com/d/msg/lczero/a66u5_FEtmg/_D9GIMgeAAAJ tcec 17 superfinal] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], April 08, 2020 » [[TCEC Season 17#Superfinal|TCEC Season 17 Sufi]]
 +
* [https://groups.google.com/d/msg/lczero/xtyGkXqeeTY/0j_DeIbkBAAJ Tcec season 18] by [[Warren D. Smith]], [[Computer Chess Forums|LCZero Forum]], June 14, 2020 » [[TCEC Season 18]]
 +
* [https://groups.google.com/d/msg/fishcooking/Tc7XRkbRrSs/mqR5NjfcBQAJ Tcec season 18] by [[Warren D. Smith]], [[Computer Chess Forums|FishCooking]], June 14, 2020
 +
 
 
=External Links=
 
=External Links=
 
* [http://wdstalks.blogspot.com/ Warren D. Smith's blog]
 
* [http://wdstalks.blogspot.com/ Warren D. Smith's blog]

Revision as of 13:29, 4 July 2020

Home * People * Warren D. Smith

Warren Douglas Smith,
an American physicist, mathematician, general theoretical scientist, and in 2005 founder of the Center of Range Voting [1]. He received a double B.Sc. from Massachusetts Institute of Technology in physics and mathematics, and a Ph.D. at Princeton University in the field of applied mathematics on computational geometry motivated by Mesh generation, under Robert E. Tarjan and John H. Conway [2]. He was affiliated with the AT&T Bell Laboratories, the NEC Research Institute, Princeton, New Jersey, where he wrote most of his papers during the 90s, and with DIMACS. His research interest covers the broad range of mathematics, physics, information theory, computer science and politics, amongst other things on algorithms, coding theory, cryptography, combinatorics, computational complexity, game tree search, game theory, computer chess, quantum mechanics, Bayesian statistics, range voting and direct democracy. With the advent of deep learning MCTS chess engines after the AlphaZero publications, Warren D. Smith discussed Leela Chess Zero as well as Stockfish topics in LCZero and FishCooking forums.

Test Suite for Chess Programs

In 1993, along with Kevin J. Lang, Warren D. Smith published and described a test suite for chess programs of about 5500 positions, optically scanned from chess books. The suite is arranged in a number of files, each file being thematic by difficulty, tactical, positional and others [3].

BPIP-DFISA

Along with Eric B. Baum et al., Warren D. Smith worked and published on game tree search, in particular the BPIP-DFISA (Best play for imperfect players - Depth free independent staircase approximation) search control model [4] [5], further generalized in 2004 by Yan Radovilsky and Solomon Eyal Shimony [6].

Smith Notation

Warren D. Smith proposed the Smith notation [7] as used in the Internet Chess Club chess server. The Smith notation encodes moves without any ambiguity using from-square, to-square, and to make it reversible, the captured piece if any - so it is as easy to go backwards as forwards while re-playing a game.

Selected Publications

[8] [9]

1989

1990 ...

1995 ...

2000 ...

2010 ...

Forum Posts

2018

2019

2020

External Links

The Future of Computers, AI (artificial intelligence), etc -- aka, You're gonna die, sucker by Warren D. Smith, March 07, 2013

References

Up one level