25,161
edits
Changes
no edit summary
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].
=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 <ref>[[Kevin J. Lang]], [[Warren D. Smith]] ('''1993'''). ''A Test Suite for Chess Programs''. [https://scorevoting.net/WarrenSmithPages/homepage/testpos.ps ps], [https://www.rangevoting.org/WarrenSmithPages/homepage/ChessTest2.tar.Z ChessTest2.tar.Z]</ref>.
=BPIP-DFISA=
