andrew_gelman_stats andrew_gelman_stats-2011 andrew_gelman_stats-2011-615 knowledge-graph by maker-knowledge-mining

615 andrew gelman stats-2011-03-16-Chess vs. checkers


meta infos for this blog

Source: html

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


Summary: the most important sentenses genereted by tfidf model

sentIndex sentText sentNum sentScore

1 Mark Palko writes : Chess derives most of its complexity through differentiated pieces; with checkers the complexity comes from the interaction between pieces. [sent-1, score-0.946]

2 The result is a series of elegant graph problems where the viable paths change with each move of your opponent. [sent-2, score-0.333]

3 To draw an analogy with chess, imagine if moving your knight could allow your opponent’s bishop to move like a rook. [sent-3, score-0.238]

4 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. [sent-4, score-0.282]

5 It’s not unusual to hear masters of both chess and checkers (draughts) to admit that they prefer the latter. [sent-8, score-1.232]

6 Why do you never see a criminal mastermind or a Bond villain playing in a checkers tournament? [sent-10, score-0.75]

7 Part of the problem is that we learn the game as children so we tend to think of it as a children’s game. [sent-11, score-0.26]

8 We focus on how simple the rules are and miss how much complexity and subtlety you can get out of those rules. [sent-12, score-0.323]

9 As a person who prefers chess to checkers, I have a slightly different story. [sent-13, score-0.661]

10 To me, checkers is much more boring to play than chess. [sent-14, score-0.739]

11 All checkers games look the same, but each chess game it its own story. [sent-15, score-1.454]

12 I expect this is true at the top levels too, but the distinction is definitely there for casual players. [sent-16, score-0.163]

13 I can play chess (at my low level) without having to think too hard most of the time and still enjoy participating, making plans, attacking and defending. [sent-17, score-0.785]

14 In contrast, when I play a casual game of checkers, it just seems to me that the pieces are moving by themselves and the whole game seems pretty random. [sent-19, score-0.778]

15 I’m not saying this is true of everyone–I’m sure Palko is right that checkers can have a lot going for it if you come at it with the right attitude–but I doubt my experiences are unique, either. [sent-20, score-0.613]

16 Overall, I think Palko’s argument about elegant simplicity applies much better to Go than to checkers. [sent-22, score-0.201]

17 ) chess is fully solved, so that we know (for example) that with optimal play the game will end in a draw. [sent-25, score-0.968]

18 Or, if they ever make that rules change so that a stalemate is a loss, maybe they’ll prove that White can force a win. [sent-26, score-0.171]

19 In a way this shouldn’t change the feel of a casual game of chess, but I wonder. [sent-27, score-0.426]


similar blogs computed by tfidf model

tfidf for this blog:

wordName wordTfidf (topN-words)

[('chess', 0.607), ('checkers', 0.573), ('game', 0.195), ('complexity', 0.161), ('play', 0.124), ('casual', 0.123), ('palko', 0.112), ('elegant', 0.105), ('games', 0.079), ('pieces', 0.076), ('change', 0.068), ('knight', 0.065), ('traps', 0.065), ('villain', 0.065), ('moving', 0.065), ('playing', 0.065), ('children', 0.065), ('rules', 0.062), ('viable', 0.062), ('bond', 0.059), ('subtlety', 0.057), ('attraction', 0.057), ('move', 0.054), ('bishop', 0.054), ('prefers', 0.054), ('attacking', 0.054), ('masters', 0.052), ('tournament', 0.052), ('derives', 0.051), ('participating', 0.05), ('opponent', 0.05), ('argument', 0.049), ('wonder', 0.049), ('criminal', 0.047), ('simplicity', 0.047), ('forced', 0.046), ('remarkable', 0.046), ('manipulation', 0.046), ('paths', 0.044), ('miss', 0.043), ('plans', 0.043), ('level', 0.042), ('possibilities', 0.042), ('boring', 0.042), ('solved', 0.042), ('optimal', 0.042), ('moderate', 0.041), ('force', 0.041), ('true', 0.04), ('feel', 0.04)]

similar blogs list:

simIndex simValue blogId blogTitle

same-blog 1 0.99999982 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

2 0.40080523 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.

3 0.39127687 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.32854727 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.31632185 1847 andrew gelman stats-2013-05-08-Of parsing and chess

Introduction: Gary Marcus writes , An algorithm that is good at chess won’t help parsing sentences, and one that parses sentences likely won’t be much help playing chess. That is soooo true. I’m excellent at parsing sentences but I’m not so great at chess. And, worse than that, my chess ability seems to be declining from year to year. Which reminds me: I recently read Frank Brady’s much lauded Endgame , a biography of Bobby Fischer. The first few chapters were great, not just the Cinderella story of his steps to the world championship, but also the background on his childhood and the stories of the games and tournaments that he lost along the way. But after Fischer beats Spassky in 1972, the book just dies. Brady has chapter after chapter on Fisher’s life, his paranoia, his girlfriends, his travels. But, really, after the chess is over, it’s just sad and kind of boring. I’d much rather have had twice as much detail on the first part of the life and then had the post-1972 era compr

6 0.23098253 1290 andrew gelman stats-2012-04-30-I suppose it’s too late to add Turing’s run-around-the-house-chess to the 2012 London Olympics?

7 0.19594865 218 andrew gelman stats-2010-08-20-I think you knew this already

8 0.17489812 1899 andrew gelman stats-2013-06-14-Turing chess tournament!

9 0.16617803 216 andrew gelman stats-2010-08-18-More forecasting competitions

10 0.15213177 1292 andrew gelman stats-2012-05-01-Colorless green facts asserted resolutely

11 0.14703403 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”

12 0.10225008 1467 andrew gelman stats-2012-08-23-The pinch-hitter syndrome again

13 0.085766777 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?

14 0.075660318 1318 andrew gelman stats-2012-05-13-Stolen jokes

15 0.068891861 2132 andrew gelman stats-2013-12-13-And now, here’s something that would make Ed Tufte spin in his . . . ummm, Tufte’s still around, actually, so let’s just say I don’t think he’d like it!

16 0.068127744 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?

17 0.063224368 29 andrew gelman stats-2010-05-12-Probability of successive wins in baseball

18 0.058595657 1930 andrew gelman stats-2013-07-09-Symposium Magazine

19 0.057970792 813 andrew gelman stats-2011-07-21-Scrabble!

20 0.054698564 99 andrew gelman stats-2010-06-19-Paired comparisons


similar blogs computed by lsi model

lsi for this blog:

topicId topicWeight

[(0, 0.086), (1, -0.035), (2, 0.001), (3, 0.03), (4, 0.019), (5, -0.014), (6, 0.045), (7, 0.014), (8, 0.045), (9, -0.009), (10, -0.018), (11, 0.025), (12, -0.014), (13, -0.04), (14, -0.024), (15, -0.01), (16, 0.003), (17, -0.029), (18, 0.007), (19, -0.016), (20, -0.056), (21, 0.074), (22, -0.007), (23, 0.073), (24, 0.044), (25, 0.089), (26, 0.046), (27, 0.101), (28, -0.031), (29, -0.198), (30, 0.098), (31, -0.207), (32, -0.04), (33, 0.033), (34, 0.066), (35, -0.06), (36, -0.099), (37, 0.041), (38, 0.075), (39, 0.149), (40, -0.059), (41, 0.107), (42, 0.06), (43, -0.005), (44, 0.022), (45, -0.116), (46, 0.082), (47, -0.014), (48, 0.032), (49, 0.049)]

similar blogs list:

simIndex simValue blogId blogTitle

1 0.97819257 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.97296101 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.91140962 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.88793886 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.82823616 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.81365424 1847 andrew gelman stats-2013-05-08-Of parsing and chess

7 0.7558248 1467 andrew gelman stats-2012-08-23-The pinch-hitter syndrome again

8 0.70778561 813 andrew gelman stats-2011-07-21-Scrabble!

9 0.68840545 2105 andrew gelman stats-2013-11-18-What’s my Kasparov number?

10 0.66690236 1290 andrew gelman stats-2012-04-30-I suppose it’s too late to add Turing’s run-around-the-house-chess to the 2012 London Olympics?

11 0.6178627 216 andrew gelman stats-2010-08-18-More forecasting competitions

12 0.56081444 1899 andrew gelman stats-2013-06-14-Turing chess tournament!

13 0.52582502 29 andrew gelman stats-2010-05-12-Probability of successive wins in baseball

14 0.51767862 1903 andrew gelman stats-2013-06-17-Weak identification provides partial information

15 0.49745327 634 andrew gelman stats-2011-03-29-A.I. is Whatever We Can’t Yet Automate

16 0.48698267 881 andrew gelman stats-2011-08-30-Rickey Henderson and Peter Angelos, together again

17 0.48159516 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?

18 0.47945297 559 andrew gelman stats-2011-02-06-Bidding for the kickoff

19 0.46869564 982 andrew gelman stats-2011-10-30-“There’s at least as much as an 80 percent chance . . .”

20 0.46866623 2262 andrew gelman stats-2014-03-23-Win probabilities during a sporting event


similar blogs computed by lda model

lda for this blog:

topicId topicWeight

[(15, 0.011), (16, 0.122), (21, 0.021), (24, 0.085), (30, 0.012), (42, 0.032), (54, 0.095), (55, 0.032), (86, 0.068), (94, 0.117), (99, 0.192)]

similar blogs list:

simIndex simValue blogId blogTitle

same-blog 1 0.92544532 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

2 0.88982332 418 andrew gelman stats-2010-11-17-ff

Introduction: Can somebody please fix the pdf reader so that it can correctly render “ff” when I cut and paste? This comes up when I’m copying sections of articles on to the blog. Thank you. P.S. I googled “ff pdf” but no help there. P.P.S. It’s a problem with “fi” also. P.P.P.S. Yes, I know about ligatures. But, if you already knew about ligatures, and I already know about ligatures, then presumably the pdf people already know about ligatures too. So why can’t their clever program, which can already find individual f’s, also find the ff’s and separate them? I assume it’s not so simple but I don’t quite understand why not.

3 0.84358507 839 andrew gelman stats-2011-08-04-To commenters who are trying to sell something

Introduction: We screen our comments. If you link to an url of the form, http://we’re-selling-you-crap.org, then you go straight into the spam folder. If you want to contribute to the discussion here, fine. Comment without the spam links. If you want to advertise, go elsewhere. It’s customary to pay for ads. We have no plans to advertise your services for free.

4 0.8368507 2253 andrew gelman stats-2014-03-17-On deck this week: Revisitings

Introduction: Just for fun I thought I’d run a week’s worth of old posts, just some things I came across when searching for various things. Of course I could just post the links right here but instead I’ll repost with my comments on how things have changed in the intervening years. Mon : In the best alternative histories, the real world is what’s ultimately real (from 2005) Tues : Comments on an anti-Bayesian (from 2006) Wed : How Americans vote (from 2012) Thurs : The candy weighing demonstration, or, the unwisdom of crowds (from 2008) Fri : Random matrices in the news (from 2010) Sat : Picking pennies in front of a steamroller: A parable comes to life (from 2011) Sun : Greg Mankiw’s utility function (from 2010)

5 0.83615392 2182 andrew gelman stats-2014-01-22-Spell-checking example demonstrates key aspects of Bayesian data analysis

Introduction: One of the new examples for the third edition of Bayesian Data Analysis is a spell-checking story. Here it is (just start at 2/3 down on the first page, with “Spelling correction”). I like this example—it demonstrates the Bayesian algebra, also gives a sense of the way that probability models (both “likelihood” and “prior”) are constructed from existing assumptions and data. The models aren’t just specified as a mathematical exercise, they represent some statement about reality. And the problem is close enough to our experience that we can consider ways in which the model can be criticized and improved, all in a simple example that has only three possibilities.

6 0.83392155 582 andrew gelman stats-2011-02-20-Statisticians vs. everybody else

7 0.83020663 185 andrew gelman stats-2010-08-04-Why does anyone support private macroeconomic forecasts?

8 0.82688963 322 andrew gelman stats-2010-10-06-More on the differences between drugs and medical devices

9 0.82451558 358 andrew gelman stats-2010-10-20-When Kerry Met Sally: Politics and Perceptions in the Demand for Movies

10 0.82433236 2179 andrew gelman stats-2014-01-20-The AAA Tranche of Subprime Science

11 0.82320374 411 andrew gelman stats-2010-11-13-Ethical concerns in medical trials

12 0.8218652 1083 andrew gelman stats-2011-12-26-The quals and the quants

13 0.82059801 722 andrew gelman stats-2011-05-20-Why no Wegmania?

14 0.81950498 377 andrew gelman stats-2010-10-28-The incoming moderate Republican congressmembers

15 0.81833827 1938 andrew gelman stats-2013-07-14-Learning how to speak

16 0.81780964 564 andrew gelman stats-2011-02-08-Different attitudes about parenting, possibly deriving from different attitudes about self

17 0.81756568 1760 andrew gelman stats-2013-03-12-Misunderstanding the p-value

18 0.81755388 1712 andrew gelman stats-2013-02-07-Philosophy and the practice of Bayesian statistics (with all the discussions!)

19 0.8163147 159 andrew gelman stats-2010-07-23-Popular governor, small state

20 0.81613213 2121 andrew gelman stats-2013-12-02-Should personal genetic testing be regulated? Battle of the blogroll