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

L Stumpers 
 
Louis Stumpers
Number of games in database: 55
Years covered: 1932 to 1969
Overall record: +13 -32 =10 (32.7%)*
   * Overall winning percentage = (wins+draws/2) / total games
      Based on games in the database; may be incomplete.

Repertoire Explorer
Most played openings
D94 Grunfeld (3 games)
E60 King's Indian Defense (2 games)
B59 Sicilian, Boleslavsky Variation, 7.Nb3 (2 games)
C65 Ruy Lopez, Berlin Defense (2 games)
D45 Queen's Gambit Declined Semi-Slav (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 the 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) He participated in five Dutch Chess Championships, with a 4th place 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 and 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 he 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, he 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) He 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' classic doctoral thesis Eenige onderzoekingen over trillingen met frequentiemodulatie (1946) can be read at http://repository.tudelft.nl/island....

Last updated: 2016-09-30 02:49:29

 page 1 of 3; games 1-25 of 55  PGN Download
Game  ResultMoves Year Event/LocaleOpening
1. L Stumpers vs J Lehr  1-019 1932 EindhovenD18 Queen's Gambit Declined Slav, Dutch
2. Prins vs L Stumpers  1-039 1936 NED-ch prelimB20 Sicilian
3. L Stumpers vs E Spanjaard  1-055 1938 Dutch Ch prelimE02 Catalan, Open, 5.Qa4
4. E Sapira vs L Stumpers 0-125 1938 NBSB - FlandersD94 Grunfeld
5. A Wijnans vs L Stumpers  1-036 1939 NED-chB05 Alekhine's Defense, Modern
6. J van den Bosch vs L Stumpers  ½-½58 1939 NED-ch11A48 King's Indian
7. L Stumpers vs S Landau 0-141 1939 NED-ch11D33 Queen's Gambit Declined, Tarrasch
8. H van Steenis vs L Stumpers  1-025 1939 NED-ch11B02 Alekhine's Defense
9. L Stumpers vs H Kramer  0-136 1940 HilversumE25 Nimzo-Indian, Samisch
10. A J van den Hoek vs L Stumpers  1-027 1941 BondswedstrijdenB10 Caro-Kann
11. T van Scheltinga vs L Stumpers 1-035 1942 NED-ch12D94 Grunfeld
12. W Wolthuis vs L Stumpers  ½-½52 1946 NED-ch prelim IC58 Two Knights
13. L Stumpers vs J H Marwitz  1-040 1946 NED-ch prelim ID31 Queen's Gambit Declined
14. G Fontein vs L Stumpers  ½-½26 1946 NED-ch prelim ID94 Grunfeld
15. L Stumpers vs H van Steenis 0-124 1946 NED-ch prelim ID28 Queen's Gambit Accepted, Classical
16. C B van den Berg vs L Stumpers  1-058 1946 NED-ch prelim ID19 Queen's Gambit Declined Slav, Dutch
17. L Stumpers vs Euwe 0-130 1946 NED-ch prelim IE60 King's Indian Defense
18. L Stumpers vs Cortlever  ½-½50 1946 NED-ch prelim IE60 King's Indian Defense
19. L Stumpers vs Grob 1-060 1947 Int BA55 Old Indian, Main line
20. L Stumpers vs H van Steenis  0-133 1947 Int BD23 Queen's Gambit Accepted
21. Tartakower vs L Stumpers 1-024 1947 Int BD74 Neo-Grunfeld, 6.cd Nxd5, 7.O-O
22. V Soultanbeieff vs L Stumpers  ½-½46 1947 Int BD96 Grunfeld, Russian Variation
23. L Stumpers vs C Vlagsma  0-145 1948 NED-ch14C65 Ruy Lopez, Berlin Defense
24. L Stumpers vs A Vinken  0-133 1948 NED-ch14E21 Nimzo-Indian, Three Knights
25. L Stumpers vs H Kramer  0-140 1948 NED-ch14B92 Sicilian, Najdorf, Opocensky Variation
 page 1 of 3; games 1-25 of 55  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 288 OF 288 ·  Later Kibitzing>
Aug-25-16
Premium Chessgames Member
  al wazir: Here's a harder question, one I don't know the answer to.

Suppose we decide to make "odds or evens" more exciting. Two players compete exactly as described above, but after each display of fingers *the loser pays the winner a number of dollars equal to the total number of fingers showing*.

Is there an optimum strategy for the even player? For the odd one?

Aug-26-16  ughaibu: About your first question; "why?" It looks as if you get a 13-12 advantage, but that would be suspiciously simple for this page.
Aug-26-16
Premium Chessgames Member
  beatgiant: <al wazir>
<Is there an optimum strategy> Yes, according to Nash's theorem.

Let's call the even player E and the odd player O.

To avoid getting dominated, each player has to choose randomly between an odd and even number of fingers with equal probability. If the probability is not equal, the other player could exploit it.

For example, suppose E chooses an even number of fingers 40% of the time and an odd number of fingers 60% of the time. Then O can choose an odd number of fingers 40% of the time and an even number of fingers 60% of the time. Then the probability distribution of the outcomes would be: (even, even) = .24
(even, odd) = .16
(odd, even) = .36
(odd, odd) = .24
which means odd would win 52% of the time. To avoid that, E needs to change to a 50/50 distribution. In that case, O also has to use a 50/50 distribution, and the result is each side has a 50% chance to win.

This shows us the answer to <al wazir>'s first question. <al wazir> must have hoped that O will naively choose between 1 through 5 uniformly at random, meaning an even number 40% of the time and an odd number 60% of the time, and aiming to exploit that by also choosing an even number 40% of the time and an odd number 60% of the time.

Aug-26-16
Premium Chessgames Member
  beatgiant: Now, having chosen an even or odd number of fingers, how to choose the actual number to maximize expected gain? The answer is, uniformly at random. If the choice is not uniform, the other player can exploit that to increase her expected gain.

For example, suppose E chooses number of fingers with the following distribution:

1 finger 10% of the time
2 fingers 10% of the time
3 fingers 10% of the time
4 fingers 40% of the time
5 fingers 30% of the time

Then O can choose number of fingers with the following distribution:

1 finger 10% of the time
2 fingers 10% of the time
3 fingers 10% of the time
4 fingers 30% of the time
5 fingers 40% of the time

Now the possible outcomes are uniform except the following:

(4,4) = .12
(5,5) = .12
(4,5) = .16
(5,4) = .09

And so O is winning $9 25% of the time, but E is winning $8 or $10 24% of the time. O will make more money in the long run.

So the optimal distribution of fingers for both players is:

1 finger 1/6 of the time
2 fingers 1/4 of the time
3 fingers 1/6 of the time
4 fingers 1/4 of the time
5 fingers 1/6 of the time

Aug-26-16
Premium Chessgames Member
  beatgiant: I'm not sure I got the second part right, and it's too time consuming for me to check my work. I'll leave it to other kibitzers to find any improvements.
Aug-26-16
Premium Chessgames Member
  al wazir: The first question was a bit of a trick.

If both players play completely at random, "even" wins 13/25 of the time. But I always held out one, three, or five fingers. The odds in favor of my winning were 3:2 unless the other captain caught on to what I was doing -- but none of my elementary school classmates were likely to notice a pattern in my choices that recurred only over days or weeks. (So this dodge probably still works, unless things have changed drastically since I frequented the playground.)

As for the second question, if both players play randomly the average win for each is $6. Since E wins one more time than O out of 25 games, he makes $0.24 per play on average. <beatgiant>'s solution is for each player to play odds half the time and evens half the time, randomly. Since this is symmetric, no one comes out ahead. This strategy also yields equality for O if E uses my strategy (assuming that O fails to notice the pattern in E's choices -- a serious oversight in someone who knows probability theory and Nash's theorem).

Aug-26-16
Premium Chessgames Member
  beatgiant: <al wazir>
Couldn't you have used a similar strategy as O? Always hold out two or four fingers. Of course, it would have been a little easier for your classmates to catch on to the pattern.
Aug-26-16
Premium Chessgames Member
  al wazir: <beatgiant: Couldn't you have used a similar strategy as O? Always hold out two or four fingers.> Yes.

<Of course, it would have been a little easier for your classmates to catch on to the pattern.> So the smart ("optimax") thing would have been *not* to always insist on being E, but as E to follow my strategy and as O to adopt your suggestion. My opponent could have equalized against me either way by randomly playing evens and odds with equal frequency.

However, if O and E both use the optimax strategy, O wins every time.

Aug-26-16
Premium Chessgames Member
  john barleycorn: <al wazir: ...

As for the second question, if both players play randomly the average win for each is $6...>

If both players play randomly then the "even" player is at an advantage of 4%. There can be no <average win for each>.

Aug-27-16
Premium Chessgames Member
  al wazir: <john barleycorn: If both players play randomly then the "even" player is at an advantage of 4%.> I expressed myself poorly. If both players play randomly, then the winner (whether E or O) gets $6 on average; but, as previously noted, E wins 13/25 of the time (52% vs. 48%).

OK?

Aug-27-16
Premium Chessgames Member
  john barleycorn: <al wazir> imo, it is the "even" player whose average win is 24ct on a constant $6 wager. "Odd" is not designed a winner in the long run by probability theory which of course does not exclude the possibility that he actually might win by luck in a 25 bet limited contest. The "expected win" is a mathematical construction to evaluate games and not a prediction for winning in short sample runs where they in fact can fluctuate heaviliy.
Aug-30-16
Premium Chessgames Member
  TheFocus: Happy Stumpday, Louis Stumpers.
Sep-27-16  WorstPlayerEver: Louis Stumpers.
Became staff member of Philips. Several patents about radio reception.
Sep-27-16  WorstPlayerEver: PS my info says he died sept-30 2003

https://profs.library.uu.nl/index.p...

Sep-27-16  WorstPlayerEver: Info seems to be incorrect, but the link I found doesn't work here. Any way, I found a biography. He played 25 times for the Dutch team and became 29 times champion of Brabant.
Sep-27-16
Premium Chessgames Member
  Stonehenge: 27th is correct:

http://www.geneaservice.nl/ar/2003/...

Sep-27-16  WorstPlayerEver: I guess so; the article I found is from 29-sept 2003 (monday).
Sep-27-16  WorstPlayerEver: The biography states he was part of a team what developed stuff like this:

https://en.m.wikipedia.org/wiki/CCIR_(selcall)

And he was vice-president of URSI:

http://sites.nationalacademies.org/...

Sep-27-16
Premium Chessgames Member
  john barleycorn: Anyone here who knows how many associative (binary) compositions there are on a set of 3 elements?
Sep-27-16
Premium Chessgames Member
  diceman: <john barleycorn: Anyone here who knows how many associative (binary) compositions there are on a set of 3 elements?>

Besides Abdel?

Sep-27-16  WorstPlayerEver: 19683.
Sep-27-16
Premium Chessgames Member
  john barleycorn: 19683 is the total number of binary compositions on a set of 3 elements and 729 of them are commutative. that is the easy part.

associative compositions have probably to be tested one by one.

Sep-27-16
Premium Chessgames Member
  john barleycorn: <diceman: ...

Besides Abdel?>

Maybe <Abdel> finds time on his <10k Jihad> to find the number. However, someone should tell him that it has nothing to do with fractions.

Sep-27-16
Premium Chessgames Member
  diceman: <john barleycorn:

<diceman: Besides Abdel?>

However, someone should tell him that it has nothing to do with fractions.>

His specialty area is "factions."

Sep-27-16
Premium Chessgames Member
  john barleycorn: <diceman> there are 8 translations for "faction" from English to German and I think each is a fit for the great autodidact.
Jump to page #    (enter # from 1 to 288)
< Earlier Kibitzing  · PAGE 288 OF 288 ·  Later Kibitzing>
NOTE: You need to pick a username and password to post a reply. Getting your account takes less than a minute, totally anonymous, and 100% free--plus, it entitles you to features otherwise unavailable. Pick your username now and join the chessgames community!
If you already have an account, you should login now.
Please observe our posting guidelines:
  1. No obscene, racist, sexist, or profane language.
  2. No spamming, advertising, or duplicating posts.
  3. No personal attacks against other members.
  4. Nothing in violation of United States law.
  5. No posting personal information of members.
Blow the Whistle See something that violates our rules? Blow the whistle and inform an administrator.


NOTE: Keep all discussion on the topic of this page. This forum is for this specific player and nothing else. If you want to discuss chess in general, or this site, you might try the Kibitzer's Café.
Messages posted by Chessgames members do not necessarily represent the views of Chessgames.com, its employees, or sponsors.
Spot an error? Please suggest your correction and help us eliminate database mistakes!


home | about | login | logout | F.A.Q. | your profile | preferences | Premium Membership | Kibitzer's Café | Biographer's Bistro | new kibitzing | chessforums | Tournament Index | Player Directory | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | privacy notice | advertising | contact us
Copyright 2001-2016, Chessgames Services LLC
Web design & database development by 20/20 Technologies