Changes

Jump to: navigation, search

Walter Faxon

22 bytes removed, 16:22, 24 January 2019
no edit summary
'''Walter G. Faxon''',<br/>
an American chess player, computer scientist , and one of the pioneers in [[BitScan|scanning bitsbit scan]]pioneer. His [[BitScan#WalterFaxonsmagicBitscan|magic bitscan]], invented in the 80s is still one of the most competitive on 32-bit architectures . On June 09, 2003 Walter made a thought-provoking [[#Appeal|appeal ]] in [[CCC]].
=Selected Games=
During the 1970 [https://en.wikipedia.org/wiki/Scholastic_chess_in_the_United_States U.S. High School Championship] at the [https://en.wikipedia.org/wiki/Hotel_McAlpin Hotel McAlpin], [https://en.wikipedia.org/wiki/New_York_City New York City],
Walter Faxon of from the winning team from of [https://en.wikipedia.org/wiki/Brookline,_Massachusetts Brookline, Massachusetts] scored 6-2. His game versus [[Danny Kopec]] , representing [https://en.wikipedia.org/wiki/Jamaica_High_School Jamaica High, N. Y.] , was published in [https://en.wikipedia.org/wiki/Israel_Albert_Horowitz Al Horowitz'] chess colums of the colum in [https://en.wikipedia.org/wiki/The_New_York_Times The New York Times] <ref>[https://www.nytimes.com/1970/06/07/archives/chess-brookline-wins-high-school-event.html Chess] by [https://en.wikipedia.org/wiki/Israel_Albert_Horowitz Al Horowitz], [https://en.wikipedia.org/wiki/The_New_York_Times The New York Times], June 7, 1970</ref>: 
<pre>
[Event "U.S. High School championship"]
}
</pre>
<span id="Appeal"></span>=Markoff - Botvinnik - Kaissa - Hsu - ABC - BerlinerAppeal=
<ref>[https://www.stmintz.com/ccc/index.php?id=299987 Markoff - Botvinnik - Kaissa - Hsu - ABC - Berliner] by [[Walter Faxon]], [[CCC]], June 09, 2003</ref>
Musings on nonstandard computer chess techniques.
And what about [[Hans Berliner|Berliner's]] [[B*]] algorithm? (Actually [[Andrew James Palay|Palay's]] probabilistic B* using a probability distribution for evaluation instead of a simple range, today suggestive that techniques from fuzzy logic might be applied.) The chess machine [[HiTech|Hitech]] was originally built for it in the early 1980's (equal first on points but second on tiebreak, [[WCCC 1986]]) -- and finally began using it. As of mid-1993 it was "almost as good as regular Hitech". In mid-1995 it was still "not quite as good as brute force searching." In the abstract of his last word on the subject (Hans J. Berliner and [[Chris McConnell]]. B* probability based search. Artificial Intelligence, Volume 86, Issue 1, September 1996, Pages 97-156) Berliner writes, "Analysis of the data indicates that should additional power become available, the B* technique will scale up considerably better than brute-force techniques." Berliner is now retired. More power is available. Where are the later papers? Where is B* today?
My suggestion: you are writing a chess program. Go ahead, put in [[NegaScout|negascout]], [[Null Move Pruning|null-move pruning]], [[Internal Iterative Deepening|IID]], everything everybody is already doing. Then, look to the literature and find some method that everybody is _not_ doing. Implement it, experiment with it, and _publish_ your results. Please.
- Walter

Navigation menu