chessgames.com
Members · Prefs · Laboratory · Collections · Openings · Endgames · Sacrifices · History · Search Kibitzing · Kibitzer's Café · Chessforums · Tournament Index · Players · Kibitzing

Louis Stumpers
L Stumpers 
 

Number of games in database: 63
Years covered: 1932 to 1969
Overall record: +14 -35 =14 (33.3%)*
   * Overall winning percentage = (wins+draws/2) / total games.

Repertoire Explorer
Most played openings
D94 Grunfeld (3 games)
B59 Sicilian, Boleslavsky Variation, 7.Nb3 (2 games)
D31 Queen's Gambit Declined (2 games)
D45 Queen's Gambit Declined Semi-Slav (2 games)
E60 King's Indian Defense (2 games)
E21 Nimzo-Indian, Three Knights (2 games)
C65 Ruy Lopez, Berlin Defense (2 games)


Search Sacrifice Explorer for Louis Stumpers
Search Google for Louis Stumpers

LOUIS STUMPERS
(born Aug-30-1911, died Sep-27-2003, 92 years old) Netherlands

[what is this?]

Frans Louis Henri Marie Stumpers was born in Eindhoven, Netherlands, on 30 August 1911. (1) He was champion of the Eindhoven Chess Club in 1938, 1939, 1946, 1947, 1948, 1949, 1951, 1952, 1953, 1955, 1957, 1958, 1961 and 1963, (2) and champion of the North Brabant Chess Federation (Noord Brabantse Schaak Bond, NBSB) in 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1946, 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1959, 1961, 1962, 1963, 1964, 1965, 1966 and 1967. (3) Stumpers participated in five Dutch Chess Championships, with his high-water mark a fourth place finish in 1948, (4) and represented his country at the 1st European Team Championship in Vienna in 1957 (two games, vs Josef Platt and Max Dorn). (5) From 1945 until about 1956, he was first Secretary and then Chairman of the NBSB. (3)

Stumpers was a physicist, and worked for the Philips company as an assistant from 1928. During 1934-1937, he studied at the University of Utrecht, where he took the master's degree. (6) In 1938 Stumpers was again employed at Philips, (6) and at a tournament in 1942, he supplied the hungry chess players with food from his employer. (3) After the war, Stumpers made a career in physics, with patents and awards on information ("radio") technology. He received degrees from several universities and colleges, including in Poland and Japan. (1, 3, 6) Stumpers retired from Philips in 1972, but continued teaching, (6) partly as professor at the University of Utrecht (1977-1981). (7) He was also Vice President (1975-1981) and Honorary President (1990-2003) of URSI, the International Union of Radio Science. (8)

Louis Stumpers married Mieke Driessen in 1954. They had five children, three girls and two boys. (6)

1) Online Familieberichten 1.0 (2016), http://www.online-familieberichten...., Digitaal Tijdschrift, 5 (255), http://www.geneaservice.nl/ar/2003/...
2) Eindhovense Schaakvereniging (2016), http://www.eindhovenseschaakverenig...
3) Noord Brabantse Schaak Bond (2016), http://www.nbsb.nl/pkalgemeen/pk-er... Their main page: http://www.nbsb.nl.
4) Schaaksite.nl (2016), http://www.schaaksite.nl/2016/01/01...
5) Olimpbase, http://www.olimpbase.org/1957eq/195...
6) K. Teer, Levensbericht F. L. H. M. Stumpers, in: Levensberichten en herdenkingen, 2004, Amsterdam, pp. 90-97, http://www.dwc.knaw.nl/DL/levensber... Also available at http://www.hagenbeuk.nl/wp-content/...
7) Catalogus Professorum Academiæ Rheno-Traiectinæ, https://profs.library.uu.nl/index.p...
8) URSI websites (2016), http://www.ursi.org/en/ursi_structu... and http://www.ursi.org/en/ursi_structu...

Suggested reading: Eindhovense Schaakvereniging 100 jaar 1915-2015, by Jules Welling. Stumpers' doctoral thesis Eenige onderzoekingen over trillingen met frequentiemodulatie (Studies on Vibration with Frequency Modulation) is found at http://repository.tudelft.nl/island...

This text by User: Tabanus. The photo was taken from http://www.dwc.knaw.nl.

Last updated: 2022-04-04 00:17:13

Try our new games table.

 page 1 of 3; games 1-25 of 63  PGN Download
Game  ResultMoves YearEvent/LocaleOpening
1. L Stumpers vs J Lehr 1-0191932EindhovenD18 Queen's Gambit Declined Slav, Dutch
2. L Prins vs L Stumpers  1-0391936NED-ch prelimB20 Sicilian
3. E Sapira vs L Stumpers 0-1251938NBSB-FlandersD94 Grunfeld
4. L Stumpers vs E Spanjaard  1-0551938NED-ch prelimE02 Catalan, Open, 5.Qa4
5. A J Wijnans vs L Stumpers  1-0361939NED-chB05 Alekhine's Defense, Modern
6. J van den Bosch vs L Stumpers  ½-½581939NED-chA48 King's Indian
7. L Stumpers vs S Landau 0-1411939NED-chD33 Queen's Gambit Declined, Tarrasch
8. H van Steenis vs L Stumpers  1-0251939NED-chB02 Alekhine's Defense
9. L Stumpers vs H Kramer  0-1361940HilversumE25 Nimzo-Indian, Samisch
10. L Stumpers vs S Landau  ½-½341940HilversumD31 Queen's Gambit Declined
11. A van den Hoek vs L Stumpers  1-0271941BondswedstrijdenB10 Caro-Kann
12. T van Scheltinga vs L Stumpers 1-0351942NED-ch12D94 Grunfeld
13. W Wolthuis vs L Stumpers  ½-½521946NED-ch prelim IC58 Two Knights
14. L Stumpers vs J H Marwitz  1-0401946NED-ch prelim ID31 Queen's Gambit Declined
15. G Fontein vs L Stumpers  ½-½261946NED-ch prelim ID94 Grunfeld
16. L Stumpers vs H van Steenis 0-1241946NED-ch prelim ID28 Queen's Gambit Accepted, Classical
17. C van den Berg vs L Stumpers  1-0581946NED-ch prelim ID19 Queen's Gambit Declined Slav, Dutch
18. L Stumpers vs Euwe 0-1301946NED-ch prelim IE60 King's Indian Defense
19. L Stumpers vs N Cortlever  ½-½501946NED-ch prelim IE60 King's Indian Defense
20. L Stumpers vs H Grob 1-0601947Baarn Group BA55 Old Indian, Main line
21. L Stumpers vs H van Steenis  0-1331947Baarn Group BD23 Queen's Gambit Accepted
22. Tartakower vs L Stumpers 1-0241947Baarn Group BD74 Neo-Grunfeld, 6.cd Nxd5, 7.O-O
23. V Soultanbeieff vs L Stumpers  ½-½461947Baarn Group BD96 Grunfeld, Russian Variation
24. L Stumpers vs A Vinken  0-1331948NED-ch sfE21 Nimzo-Indian, Three Knights
25. L Prins vs L Stumpers  ½-½301948NED-ch sfD02 Queen's Pawn Game
 page 1 of 3; games 1-25 of 63  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 31 OF 97 ·  Later Kibitzing>
Jan-21-18  john barleycorn: <al wazir: ...

The solution given there differs slightly from the one <john barleycorn> posted. In his notation: ...>

Yes, variations are possible as long as the first move is not Harry bringing over his 800 :-).

Still, anxiously awaiting the alternate solution of *the mental giant* <morfishine> based on where the wording in the problem is not clear.

Though chances are it will never happen.

Jan-21-18  zborris8: <WannaBe - you up for a couple games?> Sure! I'll seek you out for 7d games soon. Cheers!

<al wazir>

Thanks for that explanation! It would seem <ughaibu> is right then, that the brothers could still carry the full weight while juggling (or carry more weight, as you've described, depending on the height).

Would there ever be a point at which juggling could possibly solve the issue? Suppose one of the brothers had SEVEN bars of gold and was ONE bar over weight. Since he's only got TWO hands, could he possibly exert the same force on the bridge while juggling as his twin brother who has THREE bars of gold and was ONE bar overweight?

Juggling SEVEN balls in slow motion
https://www.youtube.com/watch?v=ioZ...

Here's the set-up I'm thinking about:

< Two brothers approach a bridge. The older brother has THREE bars of gold, and the younger brother has SEVEN bars of gold. It just so happens that the younger brother's weight plus the weight of his SEVEN bars of gold is equal to his older brother's weight plus the weight of his brother's THREE bars of gold. They would like to carry their gold across the bridge. Unfortunately the bridge has a weight requirement, and it can't carry both of them at the same time. To add to their dilemma, it turns out that each brother is precisely ONE bar of gold overweight. They decide on a plan together, and the little brother crossed the bridge first with all of his gold in tact. But when it was the older brother's turn to cross with all of his gold, the bridge collapsed, even though he had followed the same plan. Why? >

Does that work?

Jan-21-18
Premium Chessgames Member
  al wazir: <zborris8: Does that work?>

I can't reliably juggle even two objects, so I'm not an expert. But it seems to me that the more objects the juggler keeps in the air at once, the higher he has to toss them. And the formula I gave, F = mgH/h, says this means that the downward force on the bridge becomes proportionately greater.

Jan-21-18  zborris8: <al wazir> Thanks, even though you're no juggling expert, you've certainly made a lot of sense. I'm happy to accept your position! (Coincidentally, I've just exceeded my "juggling appreciation capacity" for the next decade or so!)
Jan-21-18  thegoodanarchist: <Marmot PFL: To complicate matters even more they each have to answer five questions (three questions) before crossing the bridge.>

They should seek help from Tim.

I don't know if Tim is his real name, but there are those who call him Tim.

Jan-21-18  thegoodanarchist: <al wazir: <ughaibu>: You should be able to solve that stumper using the same trick that works on this easier one.

Esmeralda arrives at a river bank bringing with her a goat, a wolf, and a head of cabbage. The only available means of transportation is a little boat which will hold Esmeralda and no more than one of her possessions. The wolf will eat the goat if they are left alone together, but won't touch the cabbage. The goat, however, will eat the cabbage if it gets a chance. How can Esmeralda cross the river with all her possessions intact?>

Dang, that must be one big head of cabbage!

Let me guess - Esmerelda won a ribbon at the state fair for largest cabbage. So she ties the ribbon around the cabbage, and the other end of the ribbon to the boat, and tows the cabbage back and forth with her.

Jan-21-18
Premium Chessgames Member
  al wazir: <thegoodanarchist: Dang, that must be one big head of cabbage!> No, it only weighs a couple of pounds.

The goat, the wolf, and Esmeralda herself each weigh exactly 80 pounds. Just as the bridge in <zborris8>'s problem will collapse if it's overloaded by even a couple of ounces, the boat in Alcuin's problem will sink if it is loaded with even an ounce more than 160 pounds.

If you weren't bothered by the sensitivity of that bridge, you shouldn't worry about the size of the cabbage. You might be equally distracted by reflecting that in reality cabbages float and wolves can swim. But this is an *idealized* problem.

Jan-21-18
Premium Chessgames Member
  OhioChessFan: Here's a real stumper: I wonder who complained about the posts on this page. :P
Jan-21-18
Premium Chessgames Member
  al wazir: <OhioChessFan: I wonder who complained about the posts on this page.> Did someone complain?
Jan-22-18  thegoodanarchist: <al wazir: ...

If you weren't bothered by the sensitivity of that bridge, you shouldn't worry about the size of the cabbage.>

This may well be so, however I didn't even read about the bridge.

I only ready about the cabbage/goat/wolf/woman puzzle.

But a couple people already had it solved, so I couldn't very well jump into it so much later with a solution.

I was left with the option of making a joke.

Now I don't know how other people go about solving this, but it occurred to me that if you outline your boundary conditions first, then they force you to conclude something that is required in the solution.

Since the wolf and the goat can never be left alone, *and* the cabbage and the goat can never be left alone, it is obvious that the goat must go first. And last! So if the goat must go first, and then go last, the goat must also come back.

I wonder if the folks who posted solutions used a different method?

Jan-22-18  john barleycorn: <thegoodanarchist: ...

I wonder if the folks who posted solutions used a different method?>

No, same way by excluding certain combinations on each side of the river and how to achieve them. I remember the original puzzle had a boat to cross the river. The bridge must have been built later.

Jan-22-18  Marmot PFL: Similar problem - the zombie bridge riddle.

https://www.youtube.com/watch?time_...

I figured they couldn't all make it, so one must be sacrificed to the zombies while the others escaped. Maybe the janitor (easily replaced) or the professor (has already lived a long time and should have retired years ago anyway).

This however is not the solution.

Jan-22-18  john barleycorn: <al wazir: <OhioChessFan: I wonder who complained about the posts on this page.> Did someone complain?>

Another Stumper. Do you think CG is in control of what is going on all the pages and act? Or just re-act to complains?

Jan-22-18  thegoodanarchist: A woman has birthed 2 children that are not twins. You don't know their ages, or in what order the children were born. All you know is that one of them is a boy.

Assuming the probability of boy (or girl) being conceived is exactly P = 1/2, what is the probability that the other child is a girl?

Jan-22-18  john barleycorn: it is 2/3
Jan-22-18  Marmot PFL: 2/3 chance that the other is a girl
Jan-22-18  thegoodanarchist: <jbc> and <MPFL> you are of course correct.

The 4 possible outcomes are

1. B B
2. B G
3. G B
4. G G

and they are equally probable.

We know #4 is not an option because one of the children is a B.

So the chance that the other child is a boy is included in #1, and the other is a girl is option #2 or #3.

So P(G) = 2/3.

I guess that wasn't much of a stumper, but I did get an electrical engineer with that one a few years ago.

Jan-22-18  thegoodanarchist: So you folks must also know that if you play "Let's make a Deal" you need to switch doors!

There are 3 doors. Behind one of the doors is a banana peel. Behind another door is a dead rat. Behind yet another door is $5000.

You choose door #3. The probability of the $5000 being behind #3 is P = 1/3

Door #2 is opened to reveal the banana peel. Time to switch your pick to door #1, where P ($5000) = 2/3

Jan-22-18
Premium Chessgames Member
  WannaBe: The "Let's Make a Deal" puzzle been around (probably) even before the show aired. =))
Jan-22-18  john barleycorn: < thegoodanarchist: ...

Door #2 is opened to reveal the banana peel. Time to switch your pick to door #1, where P ($5000) = 2/3>

yeah, and switch again ... and get infinitely rich ...

Jan-22-18  thegoodanarchist: < WannaBe: The "Let's Make a Deal" puzzle been around (probably) even before the show aired. =))>

Dang. You guys have heard them all.

I guess I better stick to the Rogoff page.

Jan-22-18
Premium Chessgames Member
  al wazir: Does 1/a^3 + 1/b^3 = 1/c^3 have any integer solutions?

What is the integer solution of 1/a^2 + 1/b^2 = 1/c^2 with the smallest c>0?

Jan-22-18  zborris8: <al wazir> My math sucks, but this is my guess for your puzzle: -1 and 1.
Jan-22-18  Marmot PFL: < thegoodanarchist> I caught a doctor with this one once-

Suppose that you are worried that you might have a rare disease. You decide to get tested, and suppose that the testing methods for this disease are correct 99 percent of the time (in other words, if you have the disease, it shows that you do with 99 percent probability, and if you don't have the disease, it shows that you do not with 99 percent probability). Suppose this disease is actually quite rare, occurring randomly in the general population in only one of every 10,000 people.

If your test results come back positive, what are your chances that you actually have the disease?

Do you think it is approximately: (a) .99, (b) .90, (c) .10, or (d) .01?

Jan-22-18
Premium Chessgames Member
  al wazir: <Marmot PFL>: d).

This is why (for example) mammograms should not be administered routinely to young women.

Jump to page #    (enter # from 1 to 97)
search thread:   
< Earlier Kibitzing  · PAGE 31 OF 97 ·  Later Kibitzing>

NOTE: Create an account today to post replies and access other powerful features which are available only to registered users. Becoming a member is free, anonymous, and takes less than 1 minute! If you already have a username, then simply login login under your username now to join the discussion.

Please observe our posting guidelines:

  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, duplicate, or gibberish posts.
  3. No vitriolic or systematic personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No cyberstalking or malicious posting of negative or private information (doxing/doxxing) of members.
  6. No trolling.
  7. The use of "sock puppet" accounts to circumvent disciplinary action taken by moderators, create a false impression of consensus or support, or stage conversations, is prohibited.
  8. Do not degrade Chessgames or any of it's staff/volunteers.

Please try to maintain a semblance of civility at all times.

Blow the Whistle

See something that violates our rules? Blow the whistle and inform a moderator.


NOTE: Please keep all discussion on-topic. This forum is for this specific player only. To discuss chess or this site in general, visit the Kibitzer's Café.

Messages posted by Chessgames members do not necessarily represent the views of Chessgames.com, its employees, or sponsors.
All moderator actions taken are ultimately at the sole discretion of the administration.

Spot an error? Please suggest your correction and help us eliminate database mistakes!
Home | About | Login | Logout | F.A.Q. | Profile | Preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | New Kibitzing | Chessforums | Tournament Index | Player Directory | Notable Games | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | Privacy Notice | Contact Us

Copyright 2001-2025, Chessgames Services LLC