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: 56
Years covered: 1932 to 1969
Overall record: +13 -32 =11 (33.0%)*
   * Overall winning percentage = (wins+draws/2) / total games.

Repertoire Explorer
Most played openings
D94 Grunfeld (3 games)
C65 Ruy Lopez, Berlin Defense (2 games)
D45 Queen's Gambit Declined Semi-Slav (2 games)
D31 Queen's Gambit Declined (2 games)
E60 King's Indian Defense (2 games)
B59 Sicilian, Boleslavsky Variation, 7.Nb3 (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) 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' doctoral thesis Eenige onderzoekingen over trillingen met frequentiemodulatie (Studies on Vibration with Frequency Modulation) is found at http://repository.tudelft.nl/island...

Last updated: 2018-01-16 05:40:42

 page 1 of 3; games 1-25 of 56  PGN Download
Game  ResultMoves YearEvent/LocaleOpening
1. L Stumpers vs J Lehr  1-0191932EindhovenD18 Queen's Gambit Declined Slav, Dutch
2. Prins vs L Stumpers  1-0391936NED-ch prelimB20 Sicilian
3. L Stumpers vs E Spanjaard  1-0551938Dutch Ch prelimE02 Catalan, Open, 5.Qa4
4. E Sapira vs L Stumpers 0-1251938NBSB - FlandersD94 Grunfeld
5. A J Wijnans vs L Stumpers  1-0361939NED-chB05 Alekhine's Defense, Modern
6. J van den Bosch vs L Stumpers  ½-½581939NED-ch11A48 King's Indian
7. L Stumpers vs S Landau 0-1411939NED-ch11D33 Queen's Gambit Declined, Tarrasch
8. H van Steenis vs L Stumpers  1-0251939NED-chB02 Alekhine's Defense
9. L Stumpers vs S Landau  ½-½341940HilversumD31 Queen's Gambit Declined
10. L Stumpers vs H Kramer  0-1361940HilversumE25 Nimzo-Indian, Samisch
11. A J 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 B 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 Cortlever  ½-½501946NED-ch prelim IE60 King's Indian Defense
20. L Stumpers vs Grob 1-0601947Int BA55 Old Indian, Main line
21. L Stumpers vs H van Steenis  0-1331947Int BD23 Queen's Gambit Accepted
22. Tartakower vs L Stumpers 1-0241947Int BD74 Neo-Grunfeld, 6.cd Nxd5, 7.O-O
23. V Soultanbeieff vs L Stumpers  ½-½461947Int BD96 Grunfeld, Russian Variation
24. J T Barendregt vs L Stumpers  0-1261948NED-ch14C86 Ruy Lopez, Worrall Attack
25. L Stumpers vs C Vlagsma  0-1451948NED-ch14C65 Ruy Lopez, Berlin Defense
 page 1 of 3; games 1-25 of 56  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 37 OF 37 ·  Later Kibitzing>
Feb-21-18
Premium Chessgames Member
  al wazir: <zborris8: 1. What is the maximum number of squares that a bishop can visit without revisiting any square?> 29.

For example, b1-a2-b3-a4-b5-a6-b7-c8-d7-c6-d5-c4-d3-c2-d1-e2-- f3-e4-f5-e6-f7-g8-h7-g6-h5-g4-h3-g2-h1.

<2. One clock says 11:45. The other clock says 12:05. What is the correct time if one of the clocks is 9 hours and 55 minutes fast, and the other clock is 2 hours and 25 minutes slow?>

11:45 = 705 minutes or 1,425 minutes after midnight; 12:05 = 5 minutes or 725 minutes after midnight; 9 hours and 55 minutes = 595 minutes; 2 hours and 25 minutes = 145 minutes.

Let T denote the correct time on the first clock and T' denote the correct time on the second clock.

For which of the following is T ≡ T' (modulo 720)?

a) T = 705 - 595 = 110 ≡ 830; T' = 5 + 145 = 150 ≡ 870.

b) T = 705 - 595 = 110 ≡ 830; T' = 725 + 145 = 870 ≡ 150.

c) T = 1,425 - 595 = 830 ≡ 1,550; T' = 5 + 145 = 150 ≡ 870 .

d) T = 1,425 - 595 = 830 ≡ 1,550; T' = 725 + 145 = 870 ≡ 150.

e) T = 5 - 595 = -590 ≡ 130 ≡ 850; T' = 705 + 145 = 850 ≡ 130.

f) T = 5 - 595 = -590 ≡ 130 ≡ 850; T' =1,425 + 145 = 1,570 ≡ 850 ≡ 130.

g) T = 725 - 595 = 130 ≡ 850; T' = 705 + 145 = 850 ≡ 130.

h) T = 725 - 595 = 130 ≡ 850; T' = 1,425 + 145 = 1,570 ≡ 850 ≡ 130.

Answer: e), f), g), and h). So the correct time is 2:10 am or 2:10 pm.

<3. I once had the chance to pass out books to a number of children. If I gave each child 3 books, then I would have one book left over. But if I decided to give each child 4 books, then I would have no books left by the time I got to the last child. How many books did I start with, and how many children were there?>

Let N be the number of children and B the number of books. Then B = 3N+1 and B = 4N – 4. So N= 5 and B = 16.

<4. Which of the book titles are real, and which ones are fake? https://www.boredpanda.com/funny-bo...

Most of the titles are unfamiliar to me, but I recognized the one by Malcolm Bradbury, so it's real. I therefore conjecture that all are real.

<5. What are the common names of Domenikos Theotocopoulus, and Francois-Marie Arouet?>

I don't know the first one but the second is Voltaire.

Feb-21-18
Premium Chessgames Member
  TheFocus: <Domenikos Theotocopoulus> = El Greco
Feb-21-18
Premium Chessgames Member
  Marmot PFL: <<zborris8: 1. What is the maximum number of squares that a bishop can visit without revisiting any square?>

32 I believe. Bd4-a1-c3-e1-d2-c1-b2-a3-b4-a5-d8-c7-b8-a7-b6-c5- -d6-f8-e7-h4-f6-h8-g7-h6-g5-e3-f2-g1-h2-g3-f4-e5-

Feb-21-18
Premium Chessgames Member
  al wazir: <Marmot PFL: 32 I believe.> Of course!

For some inexplicable reason I was restricting my moves to one square at a time. That's why my bishop never visited a8, e8, or f1. But it's easy to include them in the sequence I posted above if I relax that spurious restriction:

b1-a2-b3-a4-

e8-

b5-a6-b7-c8-d7-c6-

a8-

d5-c4-d3-c2-d1-e2-f3-e4-f5-e6-f7-g8-h7-g6-h5-g4-- h3-

f1-

g2-h1

Feb-21-18
Premium Chessgames Member
  john barleycorn: the phrase "visiting a square" needs to be clarified. Is the starting square a "visited square"? Moving the bishop from d4 to a1 means he has not "visited" c3 and b2?
Feb-21-18
Premium Chessgames Member
  john barleycorn: of course, after that clarified the answer to "what is the maximum number of squares ...?" cannot be an example like

<al wazir: <zborris8: 1. What is the maximum number of squares that a bishop can visit without revisiting any square?> 29.

For example, b1-a2-b3-a4-b5-a6-b7-c8-d7-c6-d5-c4-d3-c2-d1-e2-- f3-e4-f5-e6-f7-g8-h7-g6-h5-g4-h3-g2-h1. >

Feb-21-18
Premium Chessgames Member
  Marmot PFL: I took "visiting a square" to mean that once a square was touched it couldn't be crossed again. Could be interpreted in other ways too.

Toughest piece is the knight-
https://en.wikipedia.org/wiki/Knigh...

Feb-21-18
Premium Chessgames Member
  john barleycorn: <Marmot PFL: I took "visiting a square" to mean that once a square was touched it couldn't be crossed again. Could be interpreted in other ways too. ...>

I took it as moving one square diagonally. The bishop moving from a1 to c3 for example crosses b2 to which he can legally move which in my understanding means moving from a1 to c3 means the bishop "visited" b2. A knight on a1 jumps to b3 or c2 and cannot legally move to any other field.

Feb-21-18
Premium Chessgames Member
  Marmot PFL: < A knight on a1 jumps to b3 or c2 and cannot legally move to any other field.>

I have seen that knight's tour given as a timed chess test but I don't think I ever timed it myself. With black pawns on c3, c6, f3, f6 it can get frustrating. Carlen could probably whip right through it. http://www.chesschat.org/showthread...

Feb-21-18
Premium Chessgames Member
  john barleycorn: < Marmot PFL: I took "visiting a square" to mean that once a square was touched it couldn't be crossed again. ...>

According to your understanding would

<a4-e8-b5-a6-b7-c8-d7-c6-a8-d5>

be a valid move order?

Feb-21-18
Premium Chessgames Member
  Marmot PFL: No, because c6-a8 would cross b7
Feb-21-18
Premium Chessgames Member
  john barleycorn: <Marmot PFL: No, because c6-a8 would cross b7>

Thank you, also a8-d5 would cross b7 and c6. So we have the same understanding.

In fact, with this in mind we can already conclude that starting the bishop (let's say the dsb) on a square other than a1 or h8 will give a maximum of less than 31.

Feb-21-18
Premium Chessgames Member
  Marmot PFL: Thought it could get to 32 squares from most squares, except if it starts on b2 you get 31, missing a1 (or h8 if it starts on g7).
Feb-21-18
Premium Chessgames Member
  john barleycorn: Starting at b2 you sure miss a1. but how to get to h8 without either missing to visit f8 or h6?
Feb-21-18
Premium Chessgames Member
  zborris8: I won't comment on the answer to the chess puzzle <#1> as some are still sorting it out.

But I will say congratulations to <ughaibu> who solved at least <#3>, and to <al wazir> who solved at least <#2>,<#3>, and <#4> by setting up the problems when necessary. Finally, nice teamwork by <al wazir> and <TheFocus> in finding the names listed in <#5>. Good job to all!

There are a number of solutions listed for the chess puzzle. <john barleycorn> requests the definition of "visiting a square". The puzzle's definition: <"A square is 'visited' if the bishop starts from it, lands on it, or moves through it."> This definition was omitted by mistake.

To make up for the chess puzzle's omission, here is a <supplemental>: White to move and mate in 3, using each of his three pieces once and only once:


click for larger view

Feb-22-18
Premium Chessgames Member
  al wazir: <zborris8: ... here is a <supplemental>: White to move and mate in 3, using each of his three pieces once and only once.>

There is an obvious mate in 2: 1. Rd6 Kc8 2. Ra8#, or 1. Ra8+ Kxa8 2. Rc8#. But the answer you want is 1. Rd6 Kc8 2. Ka7 Kc7 3. Rac6#.

Feb-23-18
Premium Chessgames Member
  zborris8: <al wazir: There is an obvious mate in 2: 1. Rd6 Kc8 2. Ra8#, or 1. Ra8+ Kxa8 2. Rc8#. But the answer you want is 1. Rd6 Kc8 2. Ka7 Kc7 3. Rac6#.> Yup. Good job!

The given answer to the Bishop problem was 29 squares: f1 g2 h3 g4 h5 g6 h7 g8 f7 e8 d7 c8 b7 a6 b5 a4 b3 a2 b1 c2 d3 c4 d5 e6 f5 e4 f3 e2 d1.

Was 31 accomplished or not?

********

<-Numbers Puzzle->

What is the longest string of "1"s and "0"s that meets the following conditions:

A. No "1" appears exactly two digits after another "1".

B. No "0" appears exactly three digits after another "0".

Feb-24-18  Nisjesram: <awn: <jessicafischerqueen: <Nitwit Jam Head> Will you please cease your inane, rambling, profoundly uneducated spamming. It is irritating beyond comprehension. You are and have always been the most addle minded nitwit ever to post at this website. Permanent ignore. Hopefully enough will follow suit so you get auto blocked.>

I knew someone was going to say this sooner or later, and it is spot on. <Tga> is not going to be happy that <Nizzle> left his dirty toilet paper all over his forum.>

I am leaving chessgames.com forever from today (as regular poster. I may post under special circumstances which I detail below) , because instead of thanks , I get insults.

I showed <big pawn> how stupid omv argument was , I also showed him that he did not know teachings of jesus or philosophy, he did not know difference between 'personal god' and Absolute (he did not even know what Absolute is till I mentioned this 'concept' to him)

And instead of thanks , I get such insults.

Today is my last day on chessgames.com. as regular poster.Now, I may post here only if someone insults me or thanks me or needs my help in physics/maths/economics etc. Or if I need to inform people that johnlspouge has endorsed my refutation of stupid omv argument.

Thank you
Namaste

Feb-24-18
Premium Chessgames Member
  john barleycorn: < Nisjesram: ...

Today is my last day on chessgames.com. as regular poster. ...>

Thank you
Namaste

Feb-25-18
Premium Chessgames Member
  al wazir: <zborris8: What is the longest string of "1"s and "0"s that meets the following conditions:

A. No "1" appears exactly two digits after another "1".

B. No "0" appears exactly three digits after another "0".>

Suppose the first digit is 0: 0XXXXXXX...

By B the fourth digit must be 1: 0XX1XXXX

By A the second digit must be 0: 00X1XXXX

By B the fifth digit must be 1: 00X11XXX

By A the third digit must be 0: 00011XXX

But if the sixth digit is 1, that violates A. If it is 0, that violates B. Therefore the string stops at five digits.

Suppose the first digit is 1: 1XXXXXXX...

By A the third digit must be 0: 1X0XXXXX

By B the sixth digit must be 1: 1X0XX1XX

Suppose the second digit is 0: 100XX1XX

By B the fifth digit must be 1: 100X11XX

Then the fourth digit must be 0: 100011XX

But if the seventh digit is 1, that violates A. If it is 0, that violates B. Therefore the string stops at six digits.

Now suppose the second digit is 1: 110XX1XX

By A the fourth digit must be 0: 1100X1XX

By B the seventh digit must be 1: 1100X11X

By A the fifth digit must be 0: 1100011X

But if the eighth digit is 1, that violates A. If it is 0, that violates B Therefore the string stops at seven digits.

The answer is seven.

Feb-25-18
Premium Chessgames Member
  zborris8: <al wazir> That's the one, zero errors. Good job! I enjoyed the set-up as much as the solution.
Feb-25-18
Premium Chessgames Member
  WorstPlayerEver: <Nisjesram>

Thanksfor your posts!

Well, I post because this site is great for research. Obviously I have to restrict myself; because I don't feel obliged to do the homework of the GMs, who do very little fruitful homework themselves anyway. So it seems they'd rather write their obese booklets.

If I were in charge I would so and so eliminate 96% of the population. But that's another topic.

In other words: don't worry! :)

Feb-25-18
Premium Chessgames Member
  al wazir: <zborris8: That's the one, zero errors.>

In hindsight, it's obvious that the answer has to be seven. In fact, if you replace "two" by m and "three" by n in the statement of the problem, where m and n are any integers satisfying 1 < m < n, the answer is 2m + n and the longest possible string has the form 1..10..01..1.

Feb-25-18
Premium Chessgames Member
  al wazir: Let's get back to chess.

Without looking at a chessboard (or a diagram of one), answer the following questions:

1. What is the largest number of ♔s that can be placed on the board so that no ♔ is threatening a square on which another ♔ is located?

2. What is the largest number of ♕s that can be placed on the board so that no ♕ is threatening a square on which another ♕ is located?

3. What is the largest number of ♖s that can be placed on the board so that no ♖ is threatening a square on which another ♖ is located?

4. What is the largest number of ♗s that can be placed on the board so that no ♗ is threatening a square on which another ♗ is located?

5. What is the largest number of ♘s that can be placed on the board so that no ♘ is threatening a square on which another ♘ is located?

6. What is the largest number of ♙s that can be placed on the board so that no ♙ is threatening a square on which another ♙ is located?

Feb-25-18
Premium Chessgames Member
  Marmot PFL: With queens I know that it's 8. Someone evidently has proved that the answer is n queens on an nxn board as long as n is 5 or larger.
Jump to page #    (enter # from 1 to 37)
search thread:   
< Earlier Kibitzing  · PAGE 37 OF 37 ·  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 | Notable Games | World Chess Championships | Opening Explorer | Guess the Move | Game Collections | ChessBookie Game | Chessgames Challenge | Store | privacy notice | contact us
Copyright 2001-2018, Chessgames Services LLC