andrew_gelman_stats andrew_gelman_stats-2012 andrew_gelman_stats-2012-1638 knowledge-graph by maker-knowledge-mining
Source: html
Introduction: Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour.
sentIndex sentText sentNum sentScore
1 Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. [sent-1, score-1.528]
2 Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. [sent-2, score-1.304]
3 Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). [sent-3, score-0.663]
4 Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. [sent-4, score-0.556]
5 Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour. [sent-5, score-0.84]
wordName wordTfidf (topN-words)
[('chess', 0.633), ('diving', 0.278), ('hartston', 0.278), ('ilfeld', 0.278), ('underwater', 0.278), ('player', 0.161), ('lockhart', 0.126), ('exhibition', 0.119), ('lasted', 0.119), ('clocks', 0.119), ('gym', 0.114), ('swimming', 0.107), ('warnings', 0.104), ('turing', 0.104), ('variant', 0.1), ('invented', 0.098), ('master', 0.096), ('august', 0.09), ('seconds', 0.089), ('must', 0.086), ('warning', 0.086), ('william', 0.081), ('british', 0.081), ('played', 0.079), ('ready', 0.079), ('receive', 0.075), ('players', 0.073), ('hour', 0.072), ('match', 0.071), ('knowing', 0.068), ('former', 0.066), ('hours', 0.064), ('game', 0.063), ('turn', 0.058), ('entire', 0.057), ('move', 0.053), ('took', 0.05), ('david', 0.046), ('place', 0.046), ('won', 0.046), ('american', 0.046), ('result', 0.044), ('within', 0.044), ('almost', 0.044), ('interest', 0.043), ('make', 0.041), ('instead', 0.041), ('three', 0.041), ('points', 0.033), ('using', 0.026)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 1638 andrew gelman stats-2012-12-25-Diving chess
Introduction: Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour.
2 0.44854051 1473 andrew gelman stats-2012-08-28-Turing chess run update
Introduction: In honor of the Olympics , I got my butt over to the park and played run-around-the-house chess for the first time ever. As was discussed in the comments thread awhile ago , there seem to be three possible ways to play Turing chess: 1. You make your move and run around the house. The other player has to move before you return. Once you sit down to the table, the other player runs around the house. Then you have to move, etc. You lose if you are checkmated or if you fail to move before your opponent returns to his chair. 2. You make your move and run around the house. The other player has to move before you return, but he does not have to wait until you return to start running. He can start running once he’s moved. Then when you get back you have to move before he gets back, but you can start to run once you’ve moved, etc. 3. You make your move and run around the house. The other player takes as long as he wants and makes his move, then he runs. When you return, yo
3 0.40080523 615 andrew gelman stats-2011-03-16-Chess vs. checkers
Introduction: Mark Palko writes : Chess derives most of its complexity through differentiated pieces; with checkers the complexity comes from the interaction between pieces. The result is a series of elegant graph problems where the viable paths change with each move of your opponent. To draw an analogy with chess, imagine if moving your knight could allow your opponent’s bishop to move like a rook. Add to that the potential for traps and manipulation that come with forced capture and you have one of the most remarkable games of all time. . . . It’s not unusual to hear masters of both chess and checkers (draughts) to admit that they prefer the latter. So why does chess get all the respect? Why do you never see a criminal mastermind or a Bond villain playing in a checkers tournament? Part of the problem is that we learn the game as children so we tend to think of it as a children’s game. We focus on how simple the rules are and miss how much complexity and subtlety you can get out of those ru
4 0.32566735 1818 andrew gelman stats-2013-04-22-Goal: Rules for Turing chess
Introduction: Daniel Murell has more thoughts on Turing chess (last discussed here ): When I played with my brother, we had it that if you managed to lap someone while running around the house, then you got an additional move. This means that if you had the option to take the king on your additional move, you could, and doing so won you the game. He was fitter at the time so he slipped in two additional moves over the course of the game. I still won :) I am much better at him at chess though, so I’m sure he would have beaten me had we been more even. W.r.t. dsquared’s comment and your response, I’m not overly concerned about the first move, because you can enforce that white must reach a halfway point or that some time interval elapse before black makes his first move. This version though does have one significant weakness that is evident to me. If you wait a little for your opponent to return to make his second move in a row against you, you get your breath back. He couldn’t plan for th
Introduction: Daniel Murrell writes: I see you have a blog post about turing chess . . . I’ve seen another reference to it but am unable to find a definitive source. Do you know of a source where I could find out about the history of the idea? My reply: You mean the run-around-the-house thing? I don’t know where it comes from. It’s a well known story, if you google Turing chess run around the house you can find lots of references but I don’t know the definitive source. I can blog and see if anything comes up! I’ve never actually played the game. I’ll try it outdoors sometime, perhaps. When I last posted on the topic, we had a fun discussion, revealing that the rules are not as clear as one might think. It makes me wonder if anyone’s thought hard about it and come up with a good set of “official rules.” Any thoughts?
6 0.26006567 1847 andrew gelman stats-2013-05-08-Of parsing and chess
7 0.17902273 216 andrew gelman stats-2010-08-18-More forecasting competitions
8 0.1707094 1899 andrew gelman stats-2013-06-14-Turing chess tournament!
9 0.16231567 218 andrew gelman stats-2010-08-20-I think you knew this already
10 0.15456696 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”
11 0.136447 1292 andrew gelman stats-2012-05-01-Colorless green facts asserted resolutely
12 0.13333485 1903 andrew gelman stats-2013-06-17-Weak identification provides partial information
13 0.092528723 813 andrew gelman stats-2011-07-21-Scrabble!
14 0.084220447 1708 andrew gelman stats-2013-02-05-Wouldn’t it be cool if Glenn Hubbard were consulting for Herbalife and I were on the other side?
15 0.073097259 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?
17 0.055949703 2267 andrew gelman stats-2014-03-26-Is a steal really worth 9 points?
18 0.054940194 1419 andrew gelman stats-2012-07-17-“Faith means belief in something concerning which doubt is theoretically possible.” — William James
19 0.047558088 1634 andrew gelman stats-2012-12-21-Two reviews of Nate Silver’s new book, from Kaiser Fung and Cathy O’Neil
20 0.045064978 1277 andrew gelman stats-2012-04-23-Infographic of the year
topicId topicWeight
[(0, 0.042), (1, -0.018), (2, -0.001), (3, 0.023), (4, 0.023), (5, 0.006), (6, 0.034), (7, -0.001), (8, 0.027), (9, -0.017), (10, -0.006), (11, 0.009), (12, -0.011), (13, -0.022), (14, -0.035), (15, -0.004), (16, -0.002), (17, -0.031), (18, 0.008), (19, -0.02), (20, -0.053), (21, 0.092), (22, -0.001), (23, 0.082), (24, 0.047), (25, 0.1), (26, 0.025), (27, 0.092), (28, -0.023), (29, -0.204), (30, 0.077), (31, -0.212), (32, -0.05), (33, 0.033), (34, 0.046), (35, -0.055), (36, -0.098), (37, 0.013), (38, 0.07), (39, 0.121), (40, -0.041), (41, 0.103), (42, 0.05), (43, 0.012), (44, 0.032), (45, -0.139), (46, 0.087), (47, -0.046), (48, 0.041), (49, 0.061)]
simIndex simValue blogId blogTitle
same-blog 1 0.99562895 1638 andrew gelman stats-2012-12-25-Diving chess
Introduction: Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour.
2 0.91940224 615 andrew gelman stats-2011-03-16-Chess vs. checkers
Introduction: Mark Palko writes : Chess derives most of its complexity through differentiated pieces; with checkers the complexity comes from the interaction between pieces. The result is a series of elegant graph problems where the viable paths change with each move of your opponent. To draw an analogy with chess, imagine if moving your knight could allow your opponent’s bishop to move like a rook. Add to that the potential for traps and manipulation that come with forced capture and you have one of the most remarkable games of all time. . . . It’s not unusual to hear masters of both chess and checkers (draughts) to admit that they prefer the latter. So why does chess get all the respect? Why do you never see a criminal mastermind or a Bond villain playing in a checkers tournament? Part of the problem is that we learn the game as children so we tend to think of it as a children’s game. We focus on how simple the rules are and miss how much complexity and subtlety you can get out of those ru
3 0.89251715 1473 andrew gelman stats-2012-08-28-Turing chess run update
Introduction: In honor of the Olympics , I got my butt over to the park and played run-around-the-house chess for the first time ever. As was discussed in the comments thread awhile ago , there seem to be three possible ways to play Turing chess: 1. You make your move and run around the house. The other player has to move before you return. Once you sit down to the table, the other player runs around the house. Then you have to move, etc. You lose if you are checkmated or if you fail to move before your opponent returns to his chair. 2. You make your move and run around the house. The other player has to move before you return, but he does not have to wait until you return to start running. He can start running once he’s moved. Then when you get back you have to move before he gets back, but you can start to run once you’ve moved, etc. 3. You make your move and run around the house. The other player takes as long as he wants and makes his move, then he runs. When you return, yo
4 0.87692153 1818 andrew gelman stats-2013-04-22-Goal: Rules for Turing chess
Introduction: Daniel Murell has more thoughts on Turing chess (last discussed here ): When I played with my brother, we had it that if you managed to lap someone while running around the house, then you got an additional move. This means that if you had the option to take the king on your additional move, you could, and doing so won you the game. He was fitter at the time so he slipped in two additional moves over the course of the game. I still won :) I am much better at him at chess though, so I’m sure he would have beaten me had we been more even. W.r.t. dsquared’s comment and your response, I’m not overly concerned about the first move, because you can enforce that white must reach a halfway point or that some time interval elapse before black makes his first move. This version though does have one significant weakness that is evident to me. If you wait a little for your opponent to return to make his second move in a row against you, you get your breath back. He couldn’t plan for th
5 0.79407525 218 andrew gelman stats-2010-08-20-I think you knew this already
Introduction: I was playing out a chess game from the newspaper and we reminded how the best players use the entire board in their game. In my own games (I’m not very good, I’m guessing my “rating” would be something like 1500?), the action always gets concentrated on one part of the board. Grandmaster games do get focused on particular squares of the board, of course, but, meanwhile, there are implications in other places and the action can suddenly shift.
6 0.76427406 1847 andrew gelman stats-2013-05-08-Of parsing and chess
7 0.70932025 1467 andrew gelman stats-2012-08-23-The pinch-hitter syndrome again
8 0.68675727 813 andrew gelman stats-2011-07-21-Scrabble!
9 0.61610627 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?
11 0.58258468 216 andrew gelman stats-2010-08-18-More forecasting competitions
12 0.57102841 1899 andrew gelman stats-2013-06-14-Turing chess tournament!
13 0.50091463 1903 andrew gelman stats-2013-06-17-Weak identification provides partial information
14 0.46347052 29 andrew gelman stats-2010-05-12-Probability of successive wins in baseball
15 0.44691646 230 andrew gelman stats-2010-08-24-Kaggle forcasting update
16 0.42358893 881 andrew gelman stats-2011-08-30-Rickey Henderson and Peter Angelos, together again
17 0.42163756 634 andrew gelman stats-2011-03-29-A.I. is Whatever We Can’t Yet Automate
18 0.42061985 559 andrew gelman stats-2011-02-06-Bidding for the kickoff
19 0.41467911 2262 andrew gelman stats-2014-03-23-Win probabilities during a sporting event
20 0.40407455 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”
topicId topicWeight
[(6, 0.308), (9, 0.024), (19, 0.015), (24, 0.062), (31, 0.016), (40, 0.029), (54, 0.102), (63, 0.016), (77, 0.025), (89, 0.087), (99, 0.171)]
simIndex simValue blogId blogTitle
same-blog 1 0.87774134 1638 andrew gelman stats-2012-12-25-Diving chess
Introduction: Knowing of my interest in Turing run-around-the-house chess , David Lockhart points me to this : Diving Chess is a chess variant, which is played in a swimming pool. Instead of using chess clocks, each player must submerge themselves underwater during their turn, only to resurface when they are ready to make a move. Players must make a move within 5 seconds of resurfacing (they will receive a warning if not, and three warnings will result in a forfeit). Diving Chess was invented by American Chess Master Etan Ilfeld; the very first exhibition game took place between Ilfeld and former British Chess Champion William Hartston at the Thirdspace gym in Soho on August 2nd, 2011. Hartston won the match which lasted almost two hours such that each player was underwater for an entire hour.
Introduction: I’m talkin bout this .
Introduction: Marc Tanguay writes in with a specific question that has a very general answer. First, the question: I [Tanguay] am currently running a MCMC for which I have 3 parameters that are restricted to a specific space. 2 are bounded between 0 and 1 while the third is binary and updated by a Beta-Binomial. Since my priors are also bounded, I notice that, conditional on All the rest (which covers both data and other parameters), the density was not varying a lot within the space of the parameters. As a result, the acceptance rate is high, about 85%, and this despite the fact that all the parameter’s space is explore. Since in your book, the optimal acceptance rates prescribed are lower that 50% (in case of multiple parameters), do you think I should worry about getting 85%. Or is this normal given the restrictions on the parameters? First off: Yes, my guess is that you should be taking bigger jumps. 85% seems like too high an acceptance rate for Metropolis jumping. More generally, t
4 0.73871666 1710 andrew gelman stats-2013-02-06-The new Stan 1.1.1, featuring Gaussian processes!
Introduction: We just released Stan 1.1.1 and RStan 1.1.1 As usual, you can find download and install instructions at: http://mc-stan.org/ This is a patch release and is fully backward compatible with Stan and RStan 1.1.0. The main thing you should notice is that the multivariate models should be much faster and all the bugs reported for 1.1.0 have been fixed. We’ve also added a bit more functionality. The substantial changes are listed in the following release notes. v1.1.1 (5 February 2012) ====================================================================== Bug Fixes ———————————- * fixed bug in comparison operators, which swapped operator< with operator<= and swapped operator> with operator>= semantics * auto-initialize all variables to prevent segfaults * atan2 gradient propagation fixed * fixed off-by-one in NUTS treedepth bound so NUTS goes at most to specified tree depth rather than specified depth + 1 * various compiler compatibility and minor consistency issues * f
5 0.71838427 221 andrew gelman stats-2010-08-21-Busted!
Introduction: I’m just glad that universities don’t sanction professors for publishing false theorems. If the guy really is nailed by the feds for fraud, I hope they don’t throw him in prison. In general, prison time seems like a brutal, expensive, and inefficient way to punish people. I’d prefer if the government just took 95% of his salary for several years, made him do community service (cleaning equipment at the local sewage treatment plant, perhaps; a lab scientist should be good at this sort of thing, no?), etc. If restriction of this dude’s personal freedom is judged be part of the sentence, he could be given some sort of electronic tag that would send a message to the police if he were ever more than 3 miles from his home. But no need to bill the taxpayers for the cost of keeping him in prison.
7 0.65128124 819 andrew gelman stats-2011-07-24-Don’t idealize “risk aversion”
8 0.65060949 1906 andrew gelman stats-2013-06-19-“Behind a cancer-treatment firm’s rosy survival claims”
10 0.63709354 2098 andrew gelman stats-2013-11-12-Plaig!
11 0.61732531 2310 andrew gelman stats-2014-04-28-On deck this week
12 0.61222875 1576 andrew gelman stats-2012-11-13-Stan at NIPS 2012 Workshop on Probabilistic Programming
13 0.61095774 618 andrew gelman stats-2011-03-18-Prior information . . . about the likelihood
14 0.59765136 1924 andrew gelman stats-2013-07-03-Kuhn, 1-f noise, and the fractal nature of scientific revolutions
15 0.59192538 2165 andrew gelman stats-2014-01-09-San Fernando Valley cityscapes: An example of the benefits of fractal devastation?
16 0.57683754 2332 andrew gelman stats-2014-05-12-“The results (not shown) . . .”
17 0.57432294 1625 andrew gelman stats-2012-12-15-“I coach the jumpers here at Boise State . . .”
20 0.56078374 1489 andrew gelman stats-2012-09-09-Commercial Bayesian inference software is popping up all over