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 12 OF 277 ·  Later Kibitzing>
Nov-04-06
Premium Chessgames Member
  Sneaky: How many of these following statements are true?

1. At least one of these statements is false.
2. At least two of these statements are false.
3. At least three of these statements are false.
4. At least four of these statements are false.
5. At least five of these statements are false.
6. At least six of these statements are false.
7. At least seven of these statements are false.
8. At least eight of these statements are false.
9. At least nine of these statements are false.
10. All ten of these statements are false.

Nov-04-06  positionalbrilliancy: None of them.
Nov-04-06
Premium Chessgames Member
  Sneaky: Sorry, doesn't work. Consider, you claim that none of them are true. So your saying that all 10 of those statements are false, right? So you're agreeing with statement #10 then, right? Doesn't that make it true?

This one is so frustrating. The recursive nature of it all makes me go bonkers and yet once you get your head around it, it's all very clear.

Nov-04-06  positionalbrilliancy: One of them is true, number 10.
Nov-04-06
Premium Chessgames Member
  Sneaky: But if #10 is true, then it must be true that "All ten of these statements are false." which means that #10 is false. But we just said it's true! Oy!!

http://www.geocities.com/transactoi...
<Does not compute! Does not compute!>

Nov-04-06  azaris: None of the statements are valid propositions in propositional calculus, so they have no truth value.
Nov-04-06  technical draw: I have a list of one hundred digits taken from a true random source. (list A). I have another list of one hundred digits taken from another true random source. (list B). I decide to merge both lists alternating from one list to another and I produce a list of two hundered digits. (list C).

Question: Is list C a true random list?

Nov-04-06  themadhair: <Sneaky> Logically 10 → 9 → 8 → 7 → 6 → 5 → 4 → 3 → 2 → 1 (note that → means implies). So 10 must be false otherwise all statements would be necessarily true and a paradox would result.

Now if 9 were true than so also would statements 8 through 1 be true - again resulting in a paradox.

Working backwards from 10 in this way we see that statements 10 to 6 must be false in order to avoid a paradox. This allows statements 1 to 5 to be true by inspection.

<None of the statements are valid propositions in propositional calculus, so they have no truth value.> As a mathematician even I must shun this assertion that mathematics contains any truth. Mathematics is an idealised system built using the tools of logic and rigour. It is without error and imperfection. As a consequence it does not have a basis in the real world - and as such cannot have any inherent truth. To me, suggesting that mathematics contains truth is tantamount to numerology.

Nov-04-06  themadhair: <technical draw> Yes.
Nov-04-06  azaris: <technical draw> Define "true random list".
Nov-04-06  azaris: <As a mathematician even I must shun this assertion that mathematics contains any truth. Mathematics is an idealised system built using the tools of logic and rigour. It is without error and imperfection. As a consequence it does not have a basis in the real world - and as such cannot have any inherent truth. To me, suggesting that mathematics contains truth is tantamount to numerology.>

I don't think I claimed anywhere that mathematics contains inherent truth. But for logical deduction like yours to work, we must work inside a system like propositional calculus where statements have truth values and valid logical deductions ascertaining the truth values of other statements can be made.

The problem with statements like "this statement if false" or "the next statement is true" is that they work on a meta level that exists on a higher level from the usual logical propositions that we work with. Since this can easily cause paradoxes, we limit ourselves to propositions that only work on the object level. So no self- or outer-referencing propositions, please.

Nov-04-06  technical draw: <azaris> A true random list is a list of numbers (digits) where each digit has equal chance of coming out, then replacement and another event until one hundred events. (as opposed to a pseudo random list that is derived from a formula)

<themadhair> Care to elaborate, or do you have a source?. Actually, I'm studying this problem and would like others input.

Nov-04-06  azaris: <technical draw> So it's a realization of n independent uniform distributions on the set 0,1,...,9? I suppose you could interpret the shuffled union of two shorter "random lists" as one long "random list". If the individual digits are independent from each other it should not matter in which order you draw them.
Nov-04-06  themadhair: <I don't think I claimed anywhere that mathematics contains inherent truth.> I admit to misreading and misinterpreting your post and retract my comment.

<The problem with statements like "this statement if false" or "the next statement is true" is that they work on a meta level that exists on a higher level from the usual logical propositions that we work with.> Point taken, but wasn't <sneaky>'s puzzle well-defined and self-contained with the question <How many of these following statements are true?> attached to his header? The puzzle boils down to finding which statements need to be true/false in order to avoid a paradox - surely that is a task within the means of logic?

Nov-04-06  themadhair: <technical draw> What <azaris> said. When you are generating your 100 number lists you have already made the assumption that combining 100 seperate single number lists preserves randomness. So why should combining two lists be any different? Only if the method used was somehow biased - which in this case is not.
Nov-04-06  azaris: <Point taken, but wasn't <sneaky>'s puzzle well-defined and self-contained with the question <How many of these following statements are true?> attached to his header? The puzzle boils down to finding which statements need to be true/false in order to avoid a paradox - surely that is a task within the means of logic?>

Ah, but the logician wishes to drain the fun out of everything and ensure that the logical system we use to make deductions is consistent. While things might be made to work in this example, we usually forbid such propositions. And if our system of logic does not allow for such propositions, how can be use logic to deduce the correct answer?

Nov-04-06  technical draw: <azaris> Tks for your input. <it should not matter in which order you draw them> is precisely the question. Once drawn do they lose their random characteristics?
Nov-04-06  azaris: <technical draw> The realization of a random variable (like your "random digit") is not in any way random, it's just a number that stays the way it is once drawn.

Consider this experiment. You want to produce a number 0-99 by drawing both digits from a uniform distribution. But before the draw, you flip a coin to see which digit you draw first. It is easy to see that the result of the coin flip in no way alters the distribution of the resulting number.

Nov-04-06  technical draw: OK. Thanks all for considering my problem. I will use your input for futher study.
Nov-04-06  Ilgiz Tashkhodzhaev: <Ah, but the logician wishes to drain the fun out of everything and ensure that the logical system we use to make deductions is consistent.>

Ah, but this not inductively within self-containing set, so formal logic refutes such conclusion! I ask how to true logician can finds deductions implicit in puzzle, truth value is higher than 0 but less than 1. This is problem with propositional analysis in modal logic. Thanks, I.T.

Nov-04-06
Premium Chessgames Member
  Sneaky: <themadhair> <Sneaky> <Working backwards from 10 in this way we see that statements 10 to 6 must be false in order to avoid a paradox. This allows statements 1 to 5 to be true by inspection.> That's right, or I should say, that was my conclusion as well. The first half are true, the second half are false. Any other configuration leads to a paradox.
Nov-04-06
Premium Chessgames Member
  Sneaky: <I have a list of one hundred digits taken from a true random source. (list A). I have another list of one hundred digits taken from another true random source. (list B). I decide to merge both lists alternating from one list to another and I produce a list of two hundered digits. (list C).>

Like everybody here I think that list C is truly random, but wait, let's try to muddy the waters by stretching what technical draw stated.

Suppose I sent two employees into the field and tell them "bring me back lists of random numbers." One guy decides to go into the Casino and watch a certain die. He writes down the numbers that it shows: 1, 5, 6, 3, 5, 4, 2, 6, etc. The other empoyee, by sheer coincidence, decides to watch the exact same die, and starts at the exact same toss. The only difference is that he records the BOTTOM, i.e. the side that touches the felt, instead of the side that shows face-up.

Now when you interweave the two lists, they form couplets that always add up to 7. If my list starts "1, 5, 6, 3..." then his starts "6, 2, 1, 4..." When we shuffle them together the result is far from random, and yet you can argue that both lists, in themselves, are purely random.

Nov-05-06  azaris: <Now when you interweave the two lists, they form couplets that always add up to 7. If my list starts "1, 5, 6, 3..." then his starts "6, 2, 1, 4..." When we shuffle them together the result is far from random>

There is no such concept of randomness or non-randomness in probability theory. Every single list is equally likely to appear as an outcome of this random event, even "1, 1, 1,...". You won't get anywhere with probability if you invent your own intuitive concepts and try to make heads or tails (pun intended) out of them. Many have tried and failed.

Nov-05-06  themadhair: <Sneaky> Your 'counter-example' is slightly flawed. <technical draw>'s random list required that <A true random list is a list of numbers (digits) where each digit has equal chance of coming out>. This breaks down with your dice roll list for the subtle reason that if you specify list one as being random (and it is) than list two ISN'T random since it is derived from list one. In other words, given list one I could say with 100% certainty the contents of list two - ergo it isn't random if list one is random.

In terms of probability theory two events A and B are independant if P(A∩B) = P(A)P(B). Clearly in this case the two events are not independant (in fact P(A∩B) = P(A)=P(B)) so composing them in any fixed way cannot be a true random list.

<There is no such concept of randomness or non-randomness in probability theory.> That may be so, but in <technical draw>'s question the concept of 'a true random list' he (she?) introduced was well-defined within the context of his (her?) question. While we may use ideas from probability theory to better understand the question, we in no suppose that we assume there exists a concept of randomness within probability theory. Although I agree that <technical draw>'s attempts to produce such a theory have a very low probability of success - but I can't say such a scenario is impossible.

<While things might be made to work in this example, we usually forbid such propositions.> Has the logician admitted with this comment that <sneaky>'s puzzle is *gasp* logically sound?

Nov-07-06  technical draw: Here's an easy one for y'all:

You flip a coin 5 times. What has a greater chance of occuring:

1. First 3 are heads
2. First 4 are heads

Easy, no?

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