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 ^{[3]}^{[4]}, further generalized in 2004 by Yan Radovilsky and Solomon Eyal Shimony^{[5]}.

Smith notation

Warren D. Smith proposed the Smith notation^{[6]} 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.

## Table of Contents

Home * People * Warren D. SmithWarren 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, where his advisors were 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.## 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^{[3]}^{[4]}, further generalized in 2004 by Yan Radovilsky and Solomon Eyal Shimony^{[5]}.## Smith notation

Warren D. Smith proposed the Smith notation^{[6]}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

^{[7]}^{[8]}## 1989

1989).Studies in Computational Geometry Motivated by Mesh Generation. Ph.D. thesis, Princeton University, advisors Robert E. Tarjan and John H. Conway^{[9]}## 1990 ...

1990).A New Table of Constant Weight Codes. IEEE Transactions of Information Theory, Vol. 361990).Reconstructing Sets from Interpoint Distances. Symposium on Computational Geometry1992).How To Find Steiner Minimal Trees in Euclidean d-Space. Algorithmica, Vol. 7, Nos. 2-6^{[10]}^{[11]}1992).Fundamental Physical Limits on Computation. ps1992).Fixed Point for Negamaxing Probability Distributions on Regular Trees. NEC Research Institute, ps1992).Hash functions for Binary and Ternary Words. NEC Research Institute, ps1993).A Test Suite for Chess Programs. ps, ChessTest2.tar.Z^{[12]}1993).Rating Systems for Gameplayers, and Learning. ps1994).Values of the merging function and algorithm design as a game. NEC Research Institute, ps## 1995 ...

1995).Best Play for Imperfect Players and Game Tree Search. Part 1 - Theory1995).Best Play for Imperfect Players and Game Tree Search. with pseudocode appendix by Charles Garrett, ps1995).Best Play for Imperfect Players and Game Tree Search. Part 2 - Experiments, ps1997).A Bayesian Approach to Relevance in Game Playing. Artificial Intelligence, Vol. 97, CiteSeerX1998).Taking the Fuzz Out of Fuzzy Logic. NEC Research Institute, ps1999).Propagating Distributions Up Directed Acyclic Graphs. Neural Computation, Vol. 11, No. 1## 2000 ...

2000).Range Voting. pdf2002).Reconstructing Sets from Interpoint Distances. DIMACS Technical Report: 2002-372003).A new theorem in vector calculus. pdf2004).Direct Democracy. pdf2006).Church's thesis meets the N-body problem. Applied Mathematics and Computation, Vol. 178, No. 1, pdf preprint^{[13]}2007).1. AES seems weak. 2. Linear time secure cryptography. pdf, pdf^{[14]}## 2010 ...

2014).Envy-Free allocations.## External Links

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

## References

1995).Best Play for Imperfect Players and Game Tree Search. with pseudocode appendix by Charles Garrett, ps2004).Generalized Model for Rational Game Tree Search. pdf## What links here?

Up one level