User talk:Wfaxon

Poker After Dark "Stats" section update program
Written in Lua; program here.

Welcome
Hello  and welcome to Wikipedia! I'm glad you've chosen to join us. This is a great project with lots of dedicated people, which might seem intimidating at times, but don't let anything discourage you. Be bold!, explore, and contribute. Try to be civil by following simple guidelines and signing your talk comments with ~ but never forget that one of our central tenets is to ignore all rules. If you want to learn more, Tutorial is the place to go, but eventually the following links might also come in handy: Help FAQ Glossary Manual of Style Float around until you find something that tickles your fancy. One easy way to do this is to hit the random page button in the navigation bar to the left. Additionally, the Community Portal offers a more structured way to become acquainted with the many great committees and groups that focus on specific tasks. My personal favorite stomping grounds are Translation into English as well as the cleanup, welcoming, and counter-vandalism committees. Finally, the Wikimedia Foundation has several other wiki projects that you might enjoy. If you have any more questions, always feel free to ask me anything on my talk page. Again, welcome! -- Draeco 05:27, 12 May 2006 (UTC)

Wikipedia edit count cribbed from User:GDallimore
Edit count. But maybe check WikiProject edit counters first.


 * Hello, and thanks for the add :) GDallimore (Talk) 13:18, 10 May 2007 (UTC)

To do
Just notes to self so I won't lose 'em.
 * Fix Bitboard: History -- ref Strachey.
 * Alpha-beta, maybe.
 * Endianness.
 * History of perpetual motion machines -- Adams died 2006.
 * The Man from U.N.C.L.E.
 * Vela Incident -- bad weather.
 * OOP -- no one else uses "quark" in this sense. Also "directly" support.
 * Heavy water.
 * Deep Blue versus Garry Kasparov on last game of 1997 match.
 * Find out about vandal reporting, e.g. 166.70.163.162 screwed up 4 pages in 12 minutes on 5 April.
 * Chess handicap, on move + time vs. draw odds.
 * E.A. Poe "unverifiable speculation".
 * Jon Bentley / Binary search algorithm.
 * Thomas Gold / Hearing.
 * Chess handicap - Tie-break systems.
 * First-move advantage in chess - section "Solving chess", several issues: Shannon's argument against solving chess by forward search does not apply to the backwards search used to construct tablebases. The latter does not need to consider trees of non-optimal play since play from every position is limited to one level of "un-moves" and the number of possible positions is much smaller than the number of possible games.  Bremermann's argument viz. physical limits on computing is essentially identical to Shannon's thus redundant.  Also, quantum computing has no special applicability to chess or similar games; see this article quoting David Deutsch.  Also, need references to all diagrams at the positions diagrammed.  Finally, in some other section need reference viz. results in postal chess v. OTB and hypothesized reasons for any difference.

ArbCom elections are now open!
MediaWiki message delivery (talk) 13:55, 23 November 2015 (UTC)