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
ARCHIVED POSTS
< Earlier Kibitzing  · PAGE 4 OF 277 ·  Later Kibitzing>
May-30-06  ughaibu: For non-Brits, the most puzzling question might be, "what's a porky?"
May-30-06
Premium Chessgames Member
  WannaBe: Re: <"what's a porky?">

It was a movie!

May-31-06  themadhair: Ok then. A porky is a little white lie. An act of economical truth telling or an attempt to mislead.....
May-31-06  arifattar: to continue from <notsodeepthought>: 142857 x 8 = 1142856. so the sequence is broken? not really. What is missing? 7. What is extra? 1 and 6
Add the two and you get the missing no.

142857 x 9 = 1285713 (3 + 1 replaces the missing 4)

142857 x 10 = 1428570

142857 x 11 = 1571427

I wonder where it stops.

May-31-06  notsodeepthought: <themadhair: Ok then. A porky is a little white lie. An act of economical truth telling or an attempt to mislead.....> Which is why, if such an attempt or act with a goal to mislead is committed in retaliation to a previous wrong (real or perceived), the act is referred to as "Porky's Revenge."
Jun-01-06  apawnandafool: hope you all enjoy this one!


click for larger view

it's a drawn game, but black has decided that he'll resign, on one condition: you must tell him the minimum number of moves necessary for white's bishop to travel from h1 to a8, whilst passing through all the other white squares of the board once, and only once. (kings remain stationary)

for the full point, what's the number?

Jun-01-06
Premium Chessgames Member
  Sneaky: <zarra> <In your equation for expected return, <0.5(2X) + 0.5(X/2)>, you use X for two different things. In the first term, X=money in the poor envelope, whereas in the second term, X=money in the rich envelope. Shame on you!> I don't know what you mean. "X" is not the poor envelope or the rich envelope, "X" is the unknown amount of money in the envelope that was picked. The other envelope therefore should have twice that amount (2X) or half that amount (X/2) with an equal probability of each.

That's what's so befuddling about the double-or-half paradox. The math seems to add up perfectly but it defies all common sense. I don't have a pat answer.

I have told this to my math-minded friends, who were very upset to hear all of this, and to preserve their sanity they came up with DIFFERENT mathematical models of the situation which did reach the correct conclusion. The correct conclusion, of course, being that it makes no difference if you switch.

For example, forget about my "X", let's just say that the envelope with the smaller amount is Y and other one contains 2Y. Now, whichever one you pick, your expected return is 1.5*Y, and switching will not change this simple fact. Voila, problem solved.

Solved? Not at all. He never showed the flaw in my reasoning, he just provided different reasoning. That doesn't solve the paradox. If anything it shows that mathematics is built on a foundation of sand, since two perfectly acceptable mathematical methods yield entirely different results.

I don't have an answer to this one folks. It's a genuine stumper.

Jun-01-06  ughaibu: http://en.wikipedia.org/wiki/Two_en...
Jun-01-06  ganstaman: I kinda like this explaination: http://www.poker1.com/absolutenm/te...

It sorta says why the normal 'expected value' equation doesn't work. In the end, it really isn't 50/50 that the other envelope contains double or half.

Jun-01-06  WillC21: While an undergrad. in college I got a major in economics and a minor in physics; today my line of study is unrelated to physics, but I still enjoy physics problems and brain-teasers. Here's a good one(paper and pencil are necessary to solve it, as it is not a trick question):

A chain of mass "M" and length "L" is suspended vertically with its lower end just touching a scale. The chain is released suddenly and falls onto the scale. What is the reading of the scale when length "x" of the chain has fallen? Neglect sizes of individual chain links.

Note: Assume that the scale is not defective.

Jun-02-06  whatthefat: <WillC21>
I assume the point the problem is trying to make is that the parts of the chain still in free fall will not contribute to the reading on the scale - only those parts that have already landed will. So the reading on the scale would increase quadratically from zero to M.

I think it's an inexact problem though, and if you want to be accurate, it can actually be fiendishly difficult. I'll briefly outline a few of these points:

To start with, if we assume that the chain is hung perfectly straight, then when it is released, we actually require some sort of asymmetry of the chain for it to fall over into a bundle on the scale. Otherwise, assuming perfect symmetry, there's no reason for it to fall one way or the other, and it will stand on end (until the quantum fluctuations get it, which may not be long - it depends on the shape of the head of the chain).

In this rather interesting case, the bottom of the chain is not going anywhere, while the top starts to fall, so the chain will compress. This compression will continue to increase until it is sufficient to start pushing the top back up again. And you see that it will behave like a spring, expanding and contracting about it's equilibrium forever (or until the energy dissipates, obviously). In this case, we have an oscillatory reading on the scale!

Then there's the possibility of the chain bouncing off the scale when it lands, so I think we also need to assume that the collision is completely inelastic (i.e., the kinetic energy is converted purely into sound and heat, say), otherwise the problem is getting beyond the calculable realm! If the collisions are perfectly elastic (i.e., bouncy chain!), and the chain is much lighter than the earth, we'd probably have a periodic (maybe even chaotic(!), depending on how the chain was precisely arranged when it was dropped) solution, with the chain continually bouncing up and down off the scale.

Sorry to nitpick, I just saw that the problem had a number of technical points attached to it when I sat down to do it!

Jun-02-06  whatthefat: <apawnandafool: for the full point, what's the number?>

I don't think it's possible. The reason being that at some point we have to get into and out of the f1 and h3 squares. Each of those squares has 2 diagonal routes through it. However, one of those routes is common - namely the f1-h3 diagonal. Hence, we can get in and out of one of the squares, at the cost of removing one of those options for the other! The same issue applies at the opposite corner with the squares a6 and c8. So, after a brief think, I'd call the arbiter! :)

Jun-02-06  apawnandafool: <whatthefat - in and out of the f1 and h3 squares> you're right! (that's called an unintentional porky. sorry!)


click for larger view

rephrasing: you must tell him the minimum number of moves necessary for white's bishop to travel from h1 to a8, whilst passing through all the other white squares of the board AT LEAST once.

Jun-02-06  apawnandafool: <Sneaky smaller amount is Y and other one contains 2Y. Now, whichever one you pick, your expected return is 1.5*Y> this is like playing blackjack in hades for a cruise to tahiti.

let's suppose that you're holding a king and a 5. when monty hall (dressed up to look like the devil) decides to make a deal with you.

he offers you two cards face down. the first one he says, is an 8 of clubs, and the other one is a 4 of hearts.

you take one leaving it face down. he then offers you to make the switch.

if we say that the 4 is Y, and the 8 is 2Y, then you're expected return is 1.5*Y, which is 6, and you'll get 21 if you keep switching ad infinitum (and it's a sure bet, you'll go to tahiti).

but if you ever stop, you'll have a 50% chance of busting and losing the trip.

Jun-02-06  themadhair: <apawnandafool> Is it 17 moves?
Jun-02-06  apawnandafool: <the madhair is it 17 moves?> yes, well done!
Jun-02-06  themadhair: I worked out that 1.9 is an upper bound for the average number of new squares the bishop can visit. 16 moves is too few so 17 is a lower bound. Can't figure out the actual moves though.
Jun-02-06  AniamL: My favorite "paradox" is the proof that all numbers are equal.

Let a = 1, b = 1.

a = b <identity theorem>

a^2 = ab <multiply by a>

a^2 - b^2 = ab - b^2 <subtract b^2>

(a-b)(a+b) = b(a-b) <factor>

a+b = b <divide>

1+1 = 1 <substitute>

And there you have it! 2=1, and therefore (by manipulating both sides of the equation) all numbers are equal.

Jun-02-06
Premium Chessgames Member
  WannaBe: <AniamL> The problem is when you divide (a-b) which is zero. That's where the proof falls apart. =)
Jun-02-06  WillC21: <whatthefat> Yes, you must assume the chain is perfectly straight, it doesn't bounce, and so on and so forth. Here's the solution:

The reading of the scale consists of two parts: the weight of the chain accumulated and the impulse per unit time imparted by the chain colliding w/ the scale. Let's examine these two parts:

1) The weight accumulated is simply: W = (Mgx)/L ("g" is of course the gravitational constant)

2) Keep in mind that obviously the velocity of the links at the instant of hitting the scale is found from v*v = 2gx. The impulse per unit time is dp/dt. p=mv always, and so we can arrange as follows: d(mv)/dt = v(dm/dt) = v*(M/L)*v. Here, at the last stage, we can substitute from the velocity formula and obtain: 2Mg(x/L)

The solution is to sum parts (1)+(2):

Mg(x/L)+2Mg(x/L) = 3Mg(x/L)

I actually derived this problem from a advanced physics lab I took two years ago: the classes final test data confirmed the answer is correct. :)

Jun-02-06  Catfriend: <WillC21> I had it in a physics test^-^!

<AniamL> As always in such "paradoxes", the key is division by zero. Dividing by (a-b) means dividing by 1-1=0. Error.

Jun-02-06  AniamL: That doesn't stop me from befuddling little kids.
Jun-02-06  WillC21: <Catfriend> Interesting! I had the verification of it in a lab.

By the way, since the above problem was not very difficult, I can ask a much trickier(and more interesting) problem if anyone would like?

I'll check back tonight and post it if whatthefat, Catfriend, or anyone else is interested.

Jun-02-06  themadhair: <WillC21>I'd be interested. I'll be honest, if has numbers and a requirement for logical thought I'd be interested.
Jun-02-06
Premium Chessgames Member
  WannaBe: <themadhair: <WillC21>I'd be interested. I'll be honest, if has numbers and a requirement for logical thought I'd be interested.>

Would you balance my checkbook?

Jump to page #    (enter # from 1 to 277)
search thread:   
ARCHIVED POSTS
< Earlier Kibitzing  · PAGE 4 OF 277 ·  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