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 45 OF 277 ·  Later Kibitzing>
May-21-08  Tessie Tura: <Shams> <I bought the Nicholas Shakespeare bio of Chatwin but haven't read it. I'm sure you're right. Wasn't one rumor that he had died of AIDS?>

Chatwin did indeed die of AIDS, but regarding the earlier point raised about Chatwin passing it off as something else, I note that it was not uncommon for AIDS sufferers of an earlier era to maintain they had something else (or nothing at all) for a variety of reasons. For example, a number of countries, including our own, enacted travel restrictions related to AIDS victims so for some not admitting the condition was a practical necessity. And the social stigma was of course considerable. I don’t know of Chatwin’s specific circumstances, but he may have had good reasons for not telling the truth. It was very hard for many even to talk about back then.

Regarding the ‘fabrications’ there are different schools of thought. I haven’t read Shakespeare’s book but I remember reviews saying that Shakespeare defended Chatwin. I see pros and cons to his practices myself, but Chatwin was a terrific writer.

May-22-08
Premium Chessgames Member
  OhioChessFan: The Monster Meet wasn't as simple as it first appeared.
May-22-08
Premium Chessgames Member
  SwitchingQuylthulg: Isn't the answer to the Monster Meet that Frankenstein and Dracula take upset wins over both King Kong and Godzilla? As a result 1. Frankenstein (predicted third) wins with 3 victories, 2. Dracula (predicted fourth) is second with 2 victories, 3. King Kong (predicted winner) is third with 1 victory, and 4. Godzilla (predicted second) is last with no victories at all. I might have missed something of course.

In the Apollo 13 problem, I think the answer is that phases of the Earth as seen from the Moon are opposite from lunar phases as seen from the Earth (because the same side is illuminated but the opposite side is viewed), so if an observer on the Earth sees a full moon (as specified), an observer on the Moon can only see a full Earth half a month later, and the Apollo 13 mission didn't take that long.

May-22-08  Jim Bartle: "Regarding the ‘fabrications’ there are different schools of thought. I haven’t read Shakespeare’s book but I remember reviews saying that Shakespeare defended Chatwin. I see pros and cons to his practices myself, but Chatwin was a terrific writer."

Yes, he was a terrific writer, but "In Patagonia" was presented as non-fiction , where it turned out to be anything but.

And I remember a lot of press coverage on how this intrepid adventurer had contacted some extremely rare disease (transmitted by an insect bite?) in rural China. I can see him hiding that he had AIDS, but inventing something like that also added to his (partially bogus) legend.

May-22-08
Premium Chessgames Member
  al wazir: <SQ>: Right and right.
May-22-08
Premium Chessgames Member
  al wazir: <SQ>: Right and right.

<OCF>: Regarding your (tre)decimation problem, for which innumerable analogs exist, the simplest way to get the answer is to write the numbers 1--13 consecutively in a circle and go round and round, crossing out each in turn according to your prescription, until only one is left.

But any child can do that. I am troubled because I have never been able to find a general approach. I have applied this infantile algorithm to all cases from two to twelve participants and see no pattern in the results, nor any shortcut to the answer.

May-23-08
Premium Chessgames Member
  OhioChessFan: Alas, I was hoping someone could show the winning alorithm. I messed around with the problem but couldn't find a general approach to N number of players. The answer to the question as posed is <mkrk17>
May-23-08
Premium Chessgames Member
  OhioChessFan: <YouRang> gave up some of his butler duties to go on the road as a singer/dancer. When Gomez asked Lurch how much time he spent on the road, Lurch examined his work records for the 4th quarter of the previous year. In a 6 week period, <YouRang> was on the road the 1st, 4th, 8th, 9th, 11th, 12th, 22nd, 25th, 28th, and 30th of one month. He also was gone the 4th and 8th of the next month. <YouRang> only travelled one Saturday in that period.

What days of the week/days of the month were <YouRang> on the road in that 6 week period?

May-23-08
Premium Chessgames Member
  al wazir: <OCF>: Ta-da! A breakthrough! (Sorry, I'm still on your previous problem.)

Let's generalize the problem. Suppose there are N participants, and it is desired to eliminate all but one of them by the process of decimation (or as one might say, N-imation).

Arrange them all in a circle; count off N in order; instead of removing the victim from the circle, have him sit down; count off N again, starting at the next one, and again have the Nth one sit (this is always the one with whom the count originally started); and continue in this manner until only one is left standing.

We can imagine doing this for any number N > 1. Suppose we do it for some big number, say, N = 100. After each one sits down, have him count how many people are sitting at the time. That is his own personal number, which he memorizes. Thus, the first one to sit down will be number 1 and the last one to sit will be number 99. The one still standing at the end will be number 100.

Now it is desired to eliminate n-1 out of some smaller number n < N by the analogous process of n-imation. Do we have to go through the process from the beginning? No!

There is a quasi-universal rule ("quasi-" because it works only for n < N) for determining the result of the n-imation process: Have all N stand up again, arranged in the same order as before. Now tell those whose numbers are bigger than n to leave. If the count is started at the same place as before, *including only these n participants who still there*, the one who will be left at the end is the one whose personal number, as previously determined, is n.

The proof, which is easy, is left to the reader.

In practice, all you need is a single table of the numbers from 1 to 100, arranged in the proper order. To solve the problem for 13, for example, you would only have to count how far it is from the starting point (number 2) to number 13, ignoring the numbers bigger than 13. (It turns out that number 13 is the eighth one.)

May-24-08
Premium Chessgames Member
  al wazir: Ignore my previous message. It's a load of ballocks.
May-29-08
Premium Chessgames Member
  WannaBe: This musical group and a business (defence related industry) shares the same name.
May-30-08
Premium Chessgames Member
  OhioChessFan: <wannabe>, Wham?
May-30-08  Jim Bartle: Oiengo Boeingo?
May-30-08
Premium Chessgames Member
  WannaBe: I had Hughes Corporation in mind, when I posed that question. =)
May-30-08  Jim Bartle: Don't rock the boat, wannabe.
Jun-13-08
Premium Chessgames Member
  OhioChessFan: ** Answer to May 23 Stumper **

** **

<Wannabe> was on the road October and November of a year where October 1 was on a Tuesday.

Jun-14-08
Premium Chessgames Member
  OhioChessFan: It's a real Stumper why I used <Wannabe> in the answer and not <YouRang>
Jun-15-08
Premium Chessgames Member
  OhioChessFan: Creature of darkness: that am I.

Dare to harm me, I'll make you cry.

Cut short my life and before end of day,

Your family and friends: I'll make them pay.

Pure white my heart, brown is my dress.

Just who am I? Bet you can't guess.

Jun-15-08
Premium Chessgames Member
  WannaBe: <OhioChessFan> Mike Tyson?!
Jun-15-08  SetNoEscapeOn: <OhioChessFan>

An onion??

Jun-15-08
Premium Chessgames Member
  OhioChessFan: <SNEO> gave the answer I was looking for, though once again <Wannabe> has offered a valid alternative.
Jun-15-08  SetNoEscapeOn: I am a little unsure about the meaning of the third and fourth lines... Is that an allusion to bad breath from eating onions, or gas?
Jun-15-08
Premium Chessgames Member
  OhioChessFan: Both. ;)
Jun-16-08
Premium Chessgames Member
  OhioChessFan: While visiting a small town, I lost my overcoat in a bus. When I reported the matter to the bus company I was asked the number of the bus. Though I did not remember the exact number of the bus, I did remember that the bus number had a certain peculiarity about it. The number plate showed the bus number as a perfect square and also if the plate was turned upside down, the number would still be a perfect square.

I came to know from the bus company they had only five hundred buses numbered from 1 to 500. From this I was able to deduce the number.

What is the bus number?

Jun-16-08  arifattar: Finally something I understand.

196.

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