andrew_gelman_stats andrew_gelman_stats-2013 andrew_gelman_stats-2013-1818 knowledge-graph by maker-knowledge-mining
Source: html
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
sentIndex sentText sentNum sentScore
1 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. [sent-1, score-1.156]
2 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. [sent-2, score-0.341]
3 He was fitter at the time so he slipped in two additional moves over the course of the game. [sent-3, score-0.594]
4 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. [sent-4, score-0.68]
5 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. [sent-8, score-0.424]
6 This version though does have one significant weakness that is evident to me. [sent-9, score-0.326]
7 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. [sent-10, score-0.924]
8 He couldn’t plan for this tactic since it was your decision to wait. [sent-11, score-0.149]
9 So he’s probably not played his first move to check your king. [sent-12, score-0.481]
10 If he does play is second move and start running and you are in the position to take his king in two moves you can easily do it since you have had a short rest. [sent-13, score-1.008]
11 His only defense would be to see exactly what you are up to when he comes back for his second move, and wait for you to move before he does so he can respond and so that you don’t get two moves in a row. [sent-14, score-0.989]
12 If you also don’t respond, then this give time for him to catch his breath back too :) and so he will now be harder to lap when he finally does move. [sent-15, score-0.463]
13 If you can out sprint him naturally though then he still has a problem and you would both wait indefinitely if both playing optimally. [sent-16, score-0.568]
14 I’m still trying to decide on a rule set that works. [sent-18, score-0.185]
15 A google search turns up this idea : The rules are the same as standard chess but the chess clock is set up some distance away, say 10 meters, on a separate table. [sent-22, score-1.567]
16 That’s ok, I guess, but the use of the chess clock makes it less beautiful. [sent-23, score-0.748]
17 I want a pure version where the running is its own clock. [sent-24, score-0.267]
wordName wordTfidf (topN-words)
[('chess', 0.435), ('clock', 0.313), ('move', 0.296), ('lap', 0.203), ('breath', 0.203), ('moves', 0.201), ('wait', 0.18), ('running', 0.178), ('rules', 0.145), ('additional', 0.144), ('played', 0.126), ('king', 0.123), ('set', 0.115), ('beaten', 0.101), ('fitter', 0.101), ('murell', 0.101), ('game', 0.101), ('respond', 0.099), ('brother', 0.095), ('indefinitely', 0.095), ('second', 0.095), ('tactic', 0.091), ('slipped', 0.091), ('version', 0.089), ('enforce', 0.086), ('sprint', 0.086), ('halfway', 0.086), ('meters', 0.086), ('turing', 0.083), ('weakness', 0.081), ('tuning', 0.08), ('opponent', 0.078), ('evident', 0.078), ('though', 0.078), ('overly', 0.076), ('won', 0.074), ('row', 0.072), ('managed', 0.07), ('still', 0.07), ('balance', 0.065), ('standard', 0.064), ('length', 0.063), ('defense', 0.061), ('distance', 0.06), ('naturally', 0.059), ('first', 0.059), ('interval', 0.058), ('since', 0.058), ('catch', 0.057), ('two', 0.057)]
simIndex simValue blogId blogTitle
same-blog 1 1.0 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
2 0.53009242 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.32854727 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 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: 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.22734594 1847 andrew gelman stats-2013-05-08-Of parsing and chess
7 0.18025042 1553 andrew gelman stats-2012-10-30-Real rothko, fake rothko
8 0.13699286 1292 andrew gelman stats-2012-05-01-Colorless green facts asserted resolutely
9 0.1269805 216 andrew gelman stats-2010-08-18-More forecasting competitions
10 0.12467501 1899 andrew gelman stats-2013-06-14-Turing chess tournament!
11 0.11985324 218 andrew gelman stats-2010-08-20-I think you knew this already
12 0.11008663 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”
13 0.1018821 1773 andrew gelman stats-2013-03-21-2.15
14 0.099967547 1323 andrew gelman stats-2012-05-16-Question 6 of my final exam for Design and Analysis of Sample Surveys
15 0.099182032 1659 andrew gelman stats-2013-01-07-Some silly things you (didn’t) miss by not reading the sister blog
16 0.088689692 1322 andrew gelman stats-2012-05-15-Question 5 of my final exam for Design and Analysis of Sample Surveys
17 0.088244006 1243 andrew gelman stats-2012-04-03-Don’t do the King’s Gambit
18 0.08283034 1351 andrew gelman stats-2012-05-29-A Ph.D. thesis is not really a marathon
19 0.078925759 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?
20 0.077431656 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?
topicId topicWeight
[(0, 0.134), (1, -0.027), (2, 0.019), (3, 0.03), (4, 0.037), (5, -0.011), (6, 0.076), (7, -0.006), (8, 0.037), (9, -0.049), (10, 0.008), (11, -0.01), (12, 0.005), (13, -0.032), (14, -0.044), (15, -0.016), (16, -0.012), (17, -0.037), (18, 0.013), (19, -0.019), (20, -0.058), (21, 0.082), (22, 0.005), (23, 0.067), (24, 0.035), (25, 0.097), (26, 0.026), (27, 0.067), (28, -0.026), (29, -0.19), (30, 0.068), (31, -0.24), (32, -0.053), (33, 0.038), (34, 0.057), (35, -0.082), (36, -0.138), (37, 0.039), (38, 0.082), (39, 0.112), (40, -0.051), (41, 0.089), (42, 0.056), (43, 0.049), (44, 0.031), (45, -0.149), (46, 0.097), (47, -0.07), (48, 0.067), (49, 0.06)]
simIndex simValue blogId blogTitle
1 0.97277504 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.
same-blog 2 0.9694429 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
3 0.94822371 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.93373692 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
5 0.8235622 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.79629898 1847 andrew gelman stats-2013-05-08-Of parsing and chess
7 0.73782432 813 andrew gelman stats-2011-07-21-Scrabble!
8 0.73686075 1467 andrew gelman stats-2012-08-23-The pinch-hitter syndrome again
9 0.69493461 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?
11 0.65269125 216 andrew gelman stats-2010-08-18-More forecasting competitions
12 0.5685392 634 andrew gelman stats-2011-03-29-A.I. is Whatever We Can’t Yet Automate
13 0.55358016 1899 andrew gelman stats-2013-06-14-Turing chess tournament!
14 0.55190337 1903 andrew gelman stats-2013-06-17-Weak identification provides partial information
15 0.53765011 29 andrew gelman stats-2010-05-12-Probability of successive wins in baseball
17 0.49702635 559 andrew gelman stats-2011-02-06-Bidding for the kickoff
18 0.49612543 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”
19 0.48990014 1731 andrew gelman stats-2013-02-21-If a lottery is encouraging addictive gambling, don’t expand it!
20 0.4827936 230 andrew gelman stats-2010-08-24-Kaggle forcasting update
topicId topicWeight
[(2, 0.029), (12, 0.011), (13, 0.027), (16, 0.105), (21, 0.018), (24, 0.181), (76, 0.199), (86, 0.028), (87, 0.019), (89, 0.016), (99, 0.246)]
simIndex simValue blogId blogTitle
Introduction: Sandeep Baliga writes : [In a recent study , Gilles Duranton and Matthew Turner write:] For interstate highways in metropolitan areas we [Duranton and Turner] find that VKT (vehicle kilometers traveled) increases one for one with interstate highways, confirming the fundamental law of highway congestion.’ Provision of public transit also simply leads to the people taking public transport being replaced by drivers on the road. Therefore: These findings suggest that both road capacity expansions and extensions to public transit are not appropriate policies with which to combat traffic congestion. This leaves congestion pricing as the main candidate tool to curb traffic congestion. To which I reply: Sure, if your goal is to curb traffic congestion . But what sort of goal is that? Thinking like a microeconomist, my policy goal is to increase people’s utility. Sure, traffic congestion is annoying, but there must be some advantages to driving on that crowded road or pe
2 0.93344855 1551 andrew gelman stats-2012-10-28-A convenience sample and selected treatments
Introduction: Charlie Saunders writes: A study has recently been published in the New England Journal of Medicine (NEJM) which uses survival analysis to examine long-acting reversible contraception (e.g. intrauterine devices [IUDs]) vs. short-term commonly prescribed methods of contraception (e.g. oral contraceptive pills) on unintended pregnancies. The authors use a convenience sample of over 7,000 women. I am not well versed-enough in sampling theory to determine the appropriateness of this but it would seem that the use of a non-probability sampling would be a significant drawback. If you could give me your opinion on this, I would appreciate it. The NEJM is one of the top medical journals in the country. Could this type of sampling method coupled with this method of analysis be published in a journal like JASA? My reply: There are two concerns, first that it is a convenience sample and thus not representative of the population, and second that the treatments are chosen rather tha
Introduction: Jerzy Wieczorek has an interesting review of the book Graph Design for the Eye and Mind by psychology researcher Stephen Kosslyn. I recommend you read all of Wieczorek’s review (and maybe Kosslyn’s book, but that I haven’t seen), but here I’ll just focus on one point. Here’s Wieczorek summarizing Kosslyn: p. 18-19: the horizontal axis should be for the variable with the “most important part of the data.” See Kosslyn’s Figure 1.6 and 1.7 below. Figure 1.6 clearly shows that one of the sex-by-income groups reacts to age differently than the other three groups do. Figure 1.7 uses sex as the x-axis variable, making it much harder to see this same effect in the data. As a statistician exploring the data, I might make several plots using different groupings… but for communicating my results to an audience, I would choose the one plot that shows the findings most clearly. Those who know me well (or who have read the title of this post) will guess my reaction, whic
4 0.91726696 300 andrew gelman stats-2010-09-28-A calibrated Cook gives Dems the edge in Nov, sez Sandy
Introduction: Sandy Gordon sends along this fun little paper forecasting the 2010 midterm election using expert predictions (the Cook and Rothenberg Political Reports). Gordon’s gimmick is that he uses past performance to calibrate the reports’ judgments based on “solid,” “likely,” “leaning,” and “toss-up” categories, and then he uses the calibrated versions of the current predictions to make his forecast. As I wrote a few weeks ago in response to Nate’s forecasts, I think the right way to go, if you really want to forecast the election outcome, is to use national information to predict the national swing and then do regional, state, and district-level adjustments using whatever local information is available. I don’t see the point of using only the expert forecasts and no other data. Still, Gordon is bringing new information (his calibrations) to the table, so I wanted to share it with you. Ultimately I like the throw-in-everything approach that Nate uses (although I think Nate’s descr
5 0.9117533 1351 andrew gelman stats-2012-05-29-A Ph.D. thesis is not really a marathon
Introduction: Thomas Basbøll writes : A blog called The Thesis Whisperer was recently pointed out to me. I [Basbøll] haven’t looked at it closely, but I’ll be reading it regularly for a while before I recommend it. I’m sure it’s a good place to go to discover that you’re not alone, especially when you’re struggling with your dissertation. One post caught my eye immediately. It suggested that writing a thesis is not a sprint, it’s a marathon. As a metaphorical adjustment to a particular attitude about writing, it’s probably going to help some people. But if we think it through, it’s not really a very good analogy. No one is really a “sprinter”; and writing a dissertation is nothing like running a marathon. . . . Here’s Ben’s explication of the analogy at the Thesis Whisperer, which seems initially plausible. …writing a dissertation is a lot like running a marathon. They are both endurance events, they last a long time and they require a consistent and carefully calculated amount of effor
6 0.90786278 1084 andrew gelman stats-2011-12-26-Tweeting the Hits?
same-blog 7 0.90413618 1818 andrew gelman stats-2013-04-22-Goal: Rules for Turing chess
8 0.89483792 1850 andrew gelman stats-2013-05-10-The recursion of pop-econ
9 0.89154971 608 andrew gelman stats-2011-03-12-Single or multiple imputation?
10 0.88966882 337 andrew gelman stats-2010-10-12-Election symposium at Columbia Journalism School
11 0.88960755 2246 andrew gelman stats-2014-03-13-An Economist’s Guide to Visualizing Data
12 0.88459063 283 andrew gelman stats-2010-09-17-Vote Buying: Evidence from a List Experiment in Lebanon
13 0.88162529 1835 andrew gelman stats-2013-05-02-7 ways to separate errors from statistics
14 0.87741596 257 andrew gelman stats-2010-09-04-Question about standard range for social science correlations
15 0.87563306 32 andrew gelman stats-2010-05-14-Causal inference in economics
17 0.85539818 51 andrew gelman stats-2010-05-26-If statistics is so significantly great, why don’t statisticians use statistics?
18 0.85517681 922 andrew gelman stats-2011-09-24-Economists don’t think like accountants—but maybe they should
19 0.85400999 2013 andrew gelman stats-2013-09-08-What we need here is some peer review for statistical graphics
20 0.85378987 368 andrew gelman stats-2010-10-25-Is instrumental variables analysis particularly susceptible to Type M errors?