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 22 OF 94 ·  Later Kibitzing>
Sep-22-17  john barleycorn: Have not any comment of <al wazir> on this.

<If p and q are integers p^2+3q^2 is an integer >1 if q not 0. Which means a+b>2c which is impossible (case 1)

since a+b is a positive integer and
a+b=2*c*(p^2 + 3*q^2) means 1/(p^2+3q^2) is an integer and divisor of 2*c. the smallest divisor is 2 thus (p^2 + 3*q^2)<(1/2)>

Do you agree, you were wrong again?

< al wazir: ...

Also,

a+b<2c and a+b=2*c*(p^2 + 3*q^2) imply p^2+3*q^2<1, not p^2+3*q^2<1/2. ...>

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn>: If p and q are proper fractions that satisfy p^2 + 3q^2 < 1, then

a+b=2*c*(p^2 + 3*q^2)

is compatible with a + b < 2c.

THERE IS NO CONTRADICTION.

Sep-22-17  john barleycorn: <al wazir: <john barleycorn>: If p and q are proper fractions that satisfy p^2 + 3q^2 < 1, then

a+b=2*c*(p^2 + 3*q^2)

is compatible with a + b < 2c.

THERE IS NO CONTRADICTION.>

I am not saying there is a contradiction since (1/2)<1. I am just saying a+b<2c and a+b=2*c*(p^2 + 3*q^2) implies p^2+3*q^2<1/2.

While you said:

<a+b<2c and a+b=2*c*(p^2 + 3*q^2) imply p^2+3*q^2<1, not p^2+3*q^2<1/2.>

Get your act straight.

Sep-22-17  john barleycorn: <al wazir> since you like examples so much. c be odd , p=(3/4), q=0 it is

(1/2)<p<1 and

a+b=2c((9/16)=9c/8<2c

but 9c/8 is not an integer for c odd and ergo not equal to a+b.

Sep-22-17  john barleycorn: 1,2 testing ....
Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: since a+b is a positive integer and a+b=2*c*(p^2 + 3*q^2) means 1/(p^2+3q^2) is an integer and divisor of 2*c.>

Stop right there.

1/(p^2 + 3*q^2) = (a+b)/(2c).

(a+b)/(2c) doesn't have to be an integer, so 1/(p^2 + 3*q^2) doesn't have to be either. In fact, if you're assuming that a+b < 2c, it can't be.

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: 1,2 testing ....>

I went to the gym for a couple of hours. Okay?

Sep-22-17  john barleycorn: <al wazir: <john barleycorn: since a+b is a positive integer and a+b=2*c*(p^2 + 3*q^2) means 1/(p^2+3q^2) is an integer and divisor of 2*c.>

Stop right there.

1/(p^2 + 3*q^2) = (a+b)/(2c). >

Unfortunately for you

(a+b)/2c = p^2 + 3q^2

of which I never said it is an integer.

1/(p^2 + 3v^2) (the reciprocal of p^2 + 3q^2) however has to be an integer.

basic stuff. but keep trying

Sep-22-17  john barleycorn: <al wazir: ...

(a+b)/(2c) doesn't have to be an integer, so 1/(p^2 + 3*q^2) doesn't have to be either. In fact, if you're assuming that a+b < 2c, it can't be.>

I assume a+b<2c to show it cannot be. Indirect proof it is called among mathematicians. Do yourself a favour and read before you post, consult a second grader for proofreading and when ok then and only then post.

That is why I chose p=3/4 and q=0 in my example and commented "1,2 testing" because I have shown that if q=0 then p=1 is forced.

Sep-22-17  john barleycorn: I reserved my comments on your "complete" for a later point of time when I have the chance to go through it in full.
Sep-22-17  john barleycorn: <(a+b)/2c = p^2 + 3q^2

of which I never said it is an integer. >

except for p=1 and q=0, of course.

Sep-22-17  john barleycorn: <Marmot PFL: <al wazir> reminds me of this old* German perfectionist math teacher I had once...>

Actually, <al wazir> is a consultant if I remember correctly. A consultant by definition is a person who knows 1000 ways to make love to a girl but cannot get a date.

By experience I can guess his approach when on a contract or negotiating one.

He will "show" how complex the job is, what sophisticated techniques are required and only he <al wazir> can deliver. That is cheating the customer by the way. Any similarities to his dancing and singing here are purely accidental.

Stumpers is not posting any consultancy jobs though. but that does not stop him from showing off his bags of cheap tricks here.

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: Actually, <al wazir> is a consultant if I remember correctly.> Wrong again. The last time I consulted for pay was almost 20 years ago.
Sep-22-17  john barleycorn: <al wazir: ...Wrong again. The last time I consulted for pay was almost 20 years ago.>

What I remember from the Rogoff page receiving cheques even after the end of the contract I was under the impression you still are. Sorry.

Are you unemployed for the last 20 years?

Sep-22-17
Premium Chessgames Member
  al wazir: <john barleycorn: Are you unemployed for the last 20 years?> No.
Sep-23-17
Premium Chessgames Member
  Sneaky: You two get a room or something ....
Sep-23-17  diceman: <Sneaky:

You two get a room or something ..>

...or share a pi.

Oct-01-17  john barleycorn: <diceman: ...

...or share a pi.>

I have strong doubts that the <pride of Princeton> can even do that.

Oct-01-17  ughaibu: Here's a simple one: prove that it's impossible to prove the inconsistency of any relatively consistent mathematical theory.
Oct-09-17  john barleycorn: *Everybody* knows that the non-exclusive "or" with the negation is sufficient to produce all 16 combinations of composing two independent propositions in 2-valued propositional calculus.

Now, why does the exclusive "or" (either-or) does not do that?

Oct-13-17
Premium Chessgames Member
  al wazir: The decimal expansion of pi is 3.1415926535897832384626433..., etc. As we all learned in school, it is approximately equal to 22/7 = 3.142857142857... (the last six digits repeat endlessly).

A better approximation is 355/113 = 3.14159292... . But the second approximation isn't just closer to the exact value of pi, it's also *more efficient*. By that I mean that 22/7 uses three digits (2, 2, 7) to represent pi correctly to three significant figures, while 355/113 uses six digits (3, 5, 5, 1, 1, 3) to represent pi correctly to *seven* significant figures.

Is it possible to improve on that? Wikipedia (https://en.wikipedia.org/wiki/) lists several higher rational approximations, e.g., 52163/16604 and 103993/33102. But these are actually *less* efficient.

So here is your assignment for today: find an approximation to pi that is more efficient than 355/113.

Oct-13-17  Count Wedgemore: <al wazir: The decimal expansion of pi is 3.1415926535897832384626433..., etc.>

Digit no.14 after the decimal point is a 9, not an 8. Yes, I'm a stickler :)

Oct-13-17
Premium Chessgames Member
  al wazir: <Count Wedgemore: Digit no.14 after the decimal point is a 9, not an 8.> Sorry. I typed it from memory instead of copying it. My memory is pretty good, but I'm a lousy typist.
Oct-13-17
Premium Chessgames Member
  al wazir: I found 355/133 myself by hand using repeated "averaging": if r=a/b and r'=a'/b', then (a+a')/(b+b') has a value intermediate between r and r'. But this procedure gets tedious when the numbers are large.

So I've written a script that does a brute-force search (the last recourse of the clueless). The closest rational approximation to pi with a numerator under 100,000 is 99733/31746 = 3.141592641592. The closest rational approximation with numerator under 1,000,000 is 833719/265381 = 3.141592653581. In terms of my definition of efficiency, neither is an improvement on 355/133.

If the numerator has N digits and the denominator has D digits, it seems to me that the bigger N and D are, the *less* likely such an expression is to represent pi to better than N+D significant figures. (But I can't prove it.)

A product such as a*b or an *irrational* expression such as a^b might work, but I have no idea how to do a systematic search, other than by brute force.

Oct-13-17  john barleycorn: Hint #1: try to use continued fractions
Hint #2: Euler
Jump to page #   (enter # from 1 to 94)
search thread:   
< Earlier Kibitzing  · PAGE 22 OF 94 ·  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