chessgames.com

  
Louis F Stumpers
Number of games in database: 33
Years covered: 1939 to 1969
Overall record: +9 -20 =4 (33.3%)*
   * Overall winning percentage = (wins+draws/2) / total games
      Based on games in the database; may be incomplete.

Repertoire Explorer
Most played openings
D94 Grunfeld (2 games)
E60 King's Indian Defense (2 games)

Search Sacrifice Explorer for Louis F Stumpers
Search Google for Louis F Stumpers


LOUIS F STUMPERS
(born Aug-30-1911, died Sep-27-2003) Netherlands

[what is this?]

 page 1 of 2; games 1-25 of 33  PGN Download
Game  ResultMoves Year Event/LocaleOpening
1. L Stumpers vs S Landau  0-141 1939 NED-ch11D33 Queen's Gambit Declined, Tarrasch
2. H Van Steenis vs L Stumpers  1-025 1939 NED-ch11B02 Alekhine's Defense
3. T Van Scheltinga vs L Stumpers 1-035 1942 NED-ch12D94 Grunfeld
4. C B Van den Berg vs L Stumpers  1-058 1946 NED-ch prelim ID19 Queen's Gambit Declined Slav, Dutch
5. L Stumpers vs H Van Steenis 0-124 1946 NED-ch prelim ID28 Queen's Gambit Accepted, Classical
6. G Fontein vs L Stumpers  ½-½26 1946 NED-ch prelim ID94 Grunfeld
7. L Stumpers vs Cortlever  ½-½50 1946 NED-ch prelim IE60 King's Indian Defense
8. L Stumpers vs J H Marwitz  1-040 1946 NED-ch prelim ID31 Queen's Gambit Declined
9. L Stumpers vs Euwe 0-130 1946 NED-ch prelim IE60 King's Indian Defense
10. W Wolthuis vs L Stumpers  ½-½52 1946 NED-ch prelim IC58 Two Knights
11. Tartakower vs L Stumpers 1-024 1947 Int BD74 Neo-Grunfeld, 6.cd Nxd5, 7.O-O
12. L Stumpers vs H Van Steenis  0-133 1947 Int BD23 Queen's Gambit Accepted
13. L Stumpers vs Grob 1-060 1947 Int BA55 Old Indian, Main line
14. V Soultanbeieff vs L Stumpers  ½-½46 1947 Int BD96 Grunfeld, Russian Variation
15. J T Barendregt vs L Stumpers  0-126 1948 NED-ch14C86 Ruy Lopez, Worrall Attack
16. L Stumpers vs A Vinken  0-133 1948 NED-ch14E21 Nimzo-Indian, Three Knights
17. L Stumpers vs C Vlagsma  0-145 1948 NED-ch14C65 Ruy Lopez, Berlin Defense
18. L Stumpers vs T Van Scheltinga  1-047 1948 NED-ch14C97 Ruy Lopez, Closed, Chigorin
19. L Stumpers vs H Kramer  0-140 1948 NED-ch14B92 Sicilian, Najdorf, Opocensky Variation
20. J Baay vs L Stumpers  1-040 1948 NED-ch14E37 Nimzo-Indian, Classical
21. L Stumpers vs F Henneberke  1-043 1948 NED-ch14C92 Ruy Lopez, Closed
22. L Stumpers vs F Jenei  0-131 1949 HUN-NEDC99 Ruy Lopez, Closed, Chigorin, 12...cd
23. I V Rohacek vs L Stumpers  1-052 1949 CSR-NEDC47 Four Knights
24. H Kramer vs L Stumpers  1-067 1950 NED-chD79 Neo-Grunfeld, 6.O-O, Main line
25. L Stumpers vs E Spanjaard  1-044 1950 NED-chB59 Sicilian, Boleslavsky Variation, 7.Nb3
 page 1 of 2; games 1-25 of 33  PGN Download
  REFINE SEARCH:   White wins (1-0) | Black wins (0-1) | Draws (1/2-1/2) | Stumpers wins | Stumpers loses  

Kibitzer's Corner
< Earlier Kibitzing  · PAGE 117 OF 172 ·  Later Kibitzing>
Jun-13-12
Premium Chessgames Member
  OhioChessFan: Ali would have killed him.
Jun-13-12  Jim Bartle: Has the NBA made a bulk purchse of black-rimmed glsses for postgame press conferences, or are the players passing around a single pair to wear?
Jun-13-12
Premium Chessgames Member
  HeMateMe: What's next, a return to the Gazelles frames, of the 80s? In NYC people were getting killed for the expensive Gazelle frames.
Jun-17-12
Premium Chessgames Member
  talisman: who is the only world chess champion born on Father's day? :) kinda easy huh?
Jun-17-12  diceman: <OhioChessFan:
Fill in the blanks with the same seven letters in the same order: The __________ doctor was ___________ to operate because she had __________.>

The itching doctor was itching to operate because she had itching.

(sounds a bit rash to me)

Jun-18-12
Premium Chessgames Member
  Sneaky: You know what I find more annoying than the Monty Hall problem?

(I am guessing most of you know what the Monty Hall Problem is already so I'll spare you my rendition of it, but just in case there are some noobs here, have a link: http://en.wikipedia.org/wiki/Monty_...)

Here's what I find annoying, the puzzle that goes like this:

<A woman says "I have two children, and one of them is a boy." What's the probability that the other child is also a boy?>

If you don't immediately want to say 50% you are not a normal person. And yet, that's not the right answer. It's a little like the Monty Hall problem in that you're given some knowledge of the situation that changes the odds from the "instinctive" answer of 50%.

With the Monty Hall problem, I see the wrinkle that confounds everybody, and I've watched the actual show Let's Make a Deal so many times I had the "switching trick" figured out as a kid. But with THIS puzzle.... oooooh, it drives me mad. I know the right answer but I want to deny its reality.

Jun-18-12
Premium Chessgames Member
  Sneaky: I should add for clarity: when the lady says "One of them is a boy" she means "at least one of them" ... perhaps she has two boys. She's a very precise speaker.
Jun-18-12
Premium Chessgames Member
  Sneaky: From Jeopardy the other day, "Sports quotations" was the category. Who said the following?

<I just paid lip service to being the greatest. Joe, he was the greatest.>

Easy question I know, but great quote.

Jun-18-12  Jim Bartle: Who is the Louisville Lip?
Jun-18-12
Premium Chessgames Member
  Sneaky: (1) The noble SS doctor was nobless to operate because she had no bless.

(2) The Hungary doctor was "hungary" to operate because she had hun, Gary.

Jun-18-12
Premium Chessgames Member
  Sneaky: I should clarify on the Jeopardy quote: Of course he wasn't speaking of Joe Frazier, he was speaking of Joe Louis. A rare moment of humility for Ali... must have been in his retirement years.
Jun-18-12  diceman: <Sneaky: You know what I find more annoying than the Monty Hall problem?>

The Wink Martindale problem?

Jun-18-12
Premium Chessgames Member
  Marmot PFL: <<A woman says "I have two children, and one of them is a boy." What's the probability that the other child is also a boy?>

Seems simple, with 2 children you have 4 possibilities: G G, B G, G B, and B B. If you know at least 1 child is a boy, than G G is eliminated, leaving B G, G B, and B B. Hence the chance that the other child is a boy is 1/3.

Jun-18-12  Petrosianic: There's only two possibilities. Boy or girl. The first one is given in advance. So the odds are 50/50. (Or if you want to be picky, you could go by the population as a whole, which is often slightly higher female.)
Jun-18-12
Premium Chessgames Member
  Marmot PFL: <With the Monty Hall problem, I see the wrinkle that confounds everybody, and I've watched the actual show Let's Make a Deal so many times I had the "switching trick" figured out as a kid. >

I watched that show too but it's tricky, sometimes they rotate the stage and the bad looking prize is actually the best.

Jun-19-12
Premium Chessgames Member
  OhioChessFan: Several have gotten it, but for future visitors:

The <notable> doctor was <not able> to operate because she had <no table>

Jun-19-12
Premium Chessgames Member
  Marmot PFL: A casino offers a game of chance for a single player in which a fair coin is tossed at each stage. The pot starts at 1 dollar and is doubled every time a head appears. The first time a tail appears, the game ends and the player wins whatever is in the pot. Thus the player wins 1 dollar if a tail appears on the first toss, 2 dollars if a head appears on the first toss and a tail on the second, 4 dollars if a head appears on the first two tosses and a tail on the third, 8 dollars if a head appears on the first three tosses and a tail on the fourth, and so on.

What would be a fair price to pay the casino for entering the game?

Jun-19-12
Premium Chessgames Member
  Shams: I brute-forced a solution to <Marmot>'s puzzle, but I've been feeling probability-stupid lately and I'd like to learn more. Can someone post the equation that solves it?
Jun-20-12
Premium Chessgames Member
  Sneaky: Marmot's puzzle is a famous problem that I've heard dubbed the "St. Petersburg Paradox". I had a huge discussion on the subject some years ago on my chessforum because, to my surprise, it's the cornerstone of a related paradox that was driving me positively up the wall (the Envelope-Switching paradox).

<Shams> If you found a "brute force" solution I imagine you wrote a computer program to simulate the game and then ran it for a billion iterations, then divided by a billion, or something like that. If that was your method, your answer is not just wrong, but INFINITELY wrong. I'm not trying to be a jerk--I just honestly find it humorous how a sensible approach like that could fail not just by an order of magnitude, but by "an infinitude!"

In my version you get rewarded for flipping heads, and another detail is different, but its effectively the same paradox. Here's a link that explains it --> Sneaky chessforum

Jun-20-12
Premium Chessgames Member
  Shams: <Sneaky> Well, I said I brute-forced "a" solution, not "the" solution. I'm not yet convinced there is an infinite EV for this game. (I ended up at around $3.) Still, I can see that I'll have to start my crash course in probability with a still-easier problem. :)
Jun-20-12
Premium Chessgames Member
  Marmot PFL: <Sneaky> The envelope problem says a lot about human nature, but the calculations seem easy. You are shown two envelopes, told that one has twice as much money as the other and asked to choose one. Then you are asked if you want to keep the money or switch envelopes. You open the envelope and see $100, so you think, I can gain $100, and the most I can lose is $50, and it's a 50-50 chance...

100 x 1/2 + (-50) x 1/2 = 25

so you stand to make $25 by switching.

Since this is true for any amount

2 X A x 1/2 + (-A)/2 x 1/2 = A/4

don't even bother opening the first envelope, just instantly trade. To save even more time, don't even take the 1st envelope, just go directly to the 2nd one...

Jun-20-12
Premium Chessgames Member
  Marmot PFL: <Shams> Here is the Wiki explanation-

<What would be a fair price to pay the casino for entering the game? To answer this we need to consider what would be the average payout: With probability 1/2, the player wins 1 dollar; with probability 1/4 the player wins 2 dollars; with probability 1/8 the player wins 4 dollars, and so on. The expected value is thus> equation does not copy

<Assuming the game can continue as long as the coin toss results in heads, in particular that the casino has unlimited resources, this sum diverges without bound, and so the expected win for the player, at least in this idealized form, is an infinite amount of money. According to the usual treatment of deciding when it is advantageous and therefore rational to play, one should therefore play the game at any price if offered the opportunity. Yet, in published descriptions of the game, e.g., (Martin 2004), many people expressed disbelief in the result. Martin quotes Ian Hacking as saying "few of us would pay even $25 to enter such a game" and says most commentators would agree.>

http://en.wikipedia.org/wiki/St._Pe...

Jun-20-12  RMKvdS: There is no fair price. The number of times heads can be thrown consecutively is not bounded from above. Though the probability itself is limited to zero, the probability of a number of n heads in a row will never be zero. Ergo, a fair price does not exist.
Jun-20-12  izimbra: <one should therefore play the game at any price if offered the opportunity. >

The expected value is infinite, the rational is a different matter.

http://en.wikipedia.org/wiki/Utility

<Money:....The utility function is concave in the positive region, reflecting the phenomenon of diminishing marginal utility.>

Jun-20-12
Premium Chessgames Member
  Marmot PFL: <2 X A x 1/2 + (-A)/2 x 1/2 = A/4 >

should be

A x 1/2 + (-A)/2 x 1/2 = A/4

Anyway, the paradox is the conviction that no matter what choice you make in a symmetric situation with no information, you are led to think you would better off making the other choice.

Jump to page #    (enter # from 1 to 172)
< Earlier Kibitzing  · PAGE 117 OF 172 ·  Later Kibitzing>
NOTE: You need to pick a username and password to post a reply. Getting your account takes less than a minute, totally anonymous, and 100% free--plus, it entitles you to features otherwise unavailable. Pick your username now and join the chessgames community!
If you already have an account, you should login now.
Please observe our posting guidelines:
  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, or duplicating posts.
  3. No personal attacks against other users.
  4. Nothing in violation of United States law.
Blow the Whistle See something which violates our rules? Blow the whistle and inform an administrator.


NOTE: Keep all discussion on the topic of this page. This forum is for this specific player and nothing else. If you want to discuss chess in general, or this site, you might try the Kibitzer's Café.
Messages posted by Chessgames members do not necessarily represent the views of Chessgames.com, its employees, or sponsors.
Spot an error? Please suggest your correction and help us eliminate database mistakes!


home | about | login | logout | F.A.Q. | your profile | preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | new kibitzing | chessforums | Tournament Index | Player Directory | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Little ChessPartner | privacy notice | contact us
Copyright 2001-2013, Chessgames Services LLC
Web design & database development by 20/20 Technologies