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

Kenneth Regan
Number of games in database: 41
Years covered: 1974 to 2011
Last FIDE rating: 2372
Highest rating achieved in database: 2409

Overall record: +10 -13 =18 (46.3%)*
   * Overall winning percentage = (wins+draws/2) / total games in the database.

With the White pieces:
 Sicilian (7) 
    B22 B40 B30 B52
 Scotch Game (4) 
With the Black pieces:
 Sicilian (5) 
    B29 B23 B45
 English (4) 
    A10 A13 A14
Repertoire Explorer

NOTABLE GAMES: [what is this?]
   K Regan vs A Lein, 1977 1-0
   K Regan vs D Cramling, 1980 1-0
   K Regan vs Tisdall, 1977 1-0
   K Regan vs Shamkovich, 1978 1-0

NOTABLE TOURNAMENTS: [what is this?]
   Lone Pine (1977)

Search Sacrifice Explorer for Kenneth Regan
Search Google for Kenneth Regan
FIDE player card for Kenneth Regan

(born Sep-13-1959, 62 years old) United States of America

[what is this?]

Kenneth Wingate Regan is an IM (1980), his CG account is User: KWRegan. He and Mark Ginsburg were two of the stars of the Princeton chess team. Although Regan has competed in few tournaments since the early eighties, he has become well known in chess circles in recent years for applying his background in statistics and computer science to detecting cheating in competitive chess.

Last updated: 2020-03-18 04:44:55

 page 1 of 2; games 1-25 of 44  PGN Download
Game  ResultMoves YearEvent/LocaleOpening
1. Lombardy vs K Regan ½-½55197475th US OpenB00 Uncommon King's Pawn Opening
2. K Regan vs Henley  ½-½171976USA-ch U18B22 Sicilian, Alapin
3. Seirawan vs K Regan  1-0461976USA-ch U21A10 English
4. K Regan vs M Wilder 1-0231976Masters OpenB22 Sicilian, Alapin
5. K Regan vs Shamkovich 0-12319764th World OpenB07 Pirc
6. K Regan vs Balashov  0-1601977Lone PineC44 King's Pawn Game
7. Martinovsky vs K Regan  0-1511977Lone PineE00 Queen's Pawn Game
8. K Regan vs D Verduga  ½-½231977Lone PineC02 French, Advance
9. L Day vs K Regan ½-½291977Lone PineE00 Queen's Pawn Game
10. K Regan vs Tisdall 1-0411977Lone PineB06 Robatsch
11. Shamkovich vs K Regan  ½-½401977Lone PineA04 Reti Opening
12. K Regan vs A Lein 1-0231977Lone PineC55 Two Knights Defense
13. L Christiansen vs K Regan 1-0561977Lone PineA00 Uncommon Opening
14. Szabo vs K Regan 0-1571977Lone PineA40 Queen's Pawn Game
15. K Regan vs Benko  ½-½611978United States ChampionshipB22 Sicilian, Alapin
16. B Zuckerman vs K Regan  ½-½271978United States ChampionshipB29 Sicilian, Nimzovich-Rubinstein
17. Tarjan vs K Regan  ½-½191978United States ChampionshipA56 Benoni Defense
18. K Regan vs L Christiansen 0-1441978United States ChampionshipD00 Queen's Pawn Game
19. K Regan vs Rogoff ½-½161978United States ChampionshipB02 Alekhine's Defense
20. K Regan vs Kavalek  0-1331978United States ChampionshipB52 Sicilian, Canal-Sokolsky (Rossolimo) Attack
21. A Lein vs K Regan 1-0281978United States ChampionshipA13 English
22. K Regan vs K Commons  ½-½551978United States ChampionshipC49 Four Knights
23. N Weinstein vs K Regan  ½-½401978United States ChampionshipB45 Sicilian, Taimanov
24. K Regan vs Mednis  ½-½321978United States ChampionshipC02 French, Advance
25. Lombardy vs K Regan  1-0281978United States ChampionshipA10 English
 page 1 of 2; games 1-25 of 44  PGN Download
  REFINE SEARCH:   White wins (1-0) | Black wins (0-1) | Draws (1/2-1/2) | Regan wins | Regan loses  

Kibitzer's Corner
< Earlier Kibitzing  · PAGE 2 OF 2 ·  Later Kibitzing>
Dec-18-08  Strongest Force: KR is from Princeton i believe, the same as MW... GM Mike Wilder. Two more good people we lost from competitive chess.
Mar-13-09  WhiteRook48: hello, change your name please
Premium Chessgames Member
  Breunor: I thought he was one of the best players from the post Fischer generation, I think he would have been a GM if he had continued playing.

He did play for a strong Princeton team that also had Mark Ginsburg.

Premium Chessgames Member
  Stonehenge: Happy Birthday :)
Mar-20-12  Caissanist: Article in today's New York Times about a computer program that Regan has written to help detect computer-assisted cheating: .
May-28-13  jackpawn: Isn't this the guy that used to play Owens Defense with success? I seem to remember a win against Browne with it.
Premium Chessgames Member
  perfidious: <jackpawn>: Per the kibitz above by <Caissanist>, this was indeed the case-believe it was published in CL&R at the time and may have even made Informator or The Chess Player.
Jun-17-13  jackpawn: Wish more of his Owens games would appear here. As I recall his games were very interesting.
Jul-28-13  DoctorD: A recent and chilling article by Regan:

Jul-29-13  Strongest Force: Ken was a very deep thinker. We shared some interesting thoughts about where evolution was taking the human race. He was 14 at the time.
Sep-07-13  Karpova: His website:
Sep-13-13  DoctorD: In honor of Dr. Regan's work against cheating, I want to dedicate this original chess problem(*) to him, and also to test the waters in publishing chess problems in media other than traditional sources, something I am sure he would support

Steven B. Dowd
Original to

Dedicated to Dr. Kenneth Regan on his Birthday

White to Play and Mate in Three

click for larger view

A Rex Solus problem. As a hint, a Rex Solus (black king only) should contain interesting play and a nice variety of mates, with the black king given as much opportunity to flee as possible. I hope I succeeded.

(*) I checked the Chess Problem Database Server to look for any possible predecessors and none appeared - it would certainly be embarrassing to salute someone for high moral standards with a plagiarized problem!

Sep-13-13  DoctorD: For those interested in composing, here is an example. After one line in the above, you essentially have a y-flight #2 that can be expressed through a number of board rotations and keys. I had to search for those too, and I certainly found examples of those, the oldest from 1915 and one example from this years.

The earliest example:

Gunnar Gundersen
The Australasian 12/1915

White to play and mate in two

click for larger view

You'll note this is a rotation of my position after one move. My decision was whether the threemover showed enough content to be considered relatively original. I think so, but also posed the question on several fora.

Sep-19-13  Kinghunt: I have just read Regan's paper detailing his system of intrinsic performance rating:

Overall, I was quite impressed. It seems to do a good job of matching play with playing strength. For instance, the recent Anand-Gelfand match has by far the highest level of play, which makes sense given that virtually all moves played in that match were chosen in advance by machines.

Certain limitations apply in trying to make use of this system, however. The confidence intervals are very wide, and on several occasions, it picks the losing player as having played the better chess. However, that simply means over-zealous fans should not try and use this to compare players throughout history. It has more than sufficient resolution to achieve its desired purpose, namely, to identify the use of computers in chess. (And it does, in the Anand-Gelfand match.)

Feb-22-14  RedShield: <<In this concrete instance, however, one can make a pretty good nay-case. According to Wikipedia, the "Shannon Number" for the game-tree size of chess is estimated between 10^120 and 10^123. Right in that range is the "Bekenstein Bound" of 10^122 bits for the observable universe, which as explained by a colleague here ( is a limit on the size of any computation. Put another way, if a 32-piece Nalimov tablebase existed---even if it would be serviced by Rybka clusters in other galaxies---our entire Universe would collapse into a black hole!>

Premium Chessgames Member
  alexmagnus: <RedShield> That is not true however as to compile a 32-piece tablebase one doesn't need the entire game tree - transpositions get excluded. Say, all games starting with 1.e4 e6 2.d4 and 1.d4 e6 2.e4 don't have to be listed double. The number of <positions> in chess is much smaller - about 2*10^46.
Feb-22-14  RedShield: Yes, but don't the transpositions have to be generated before they can be excluded?
Premium Chessgames Member
  alexmagnus: Why should they be? Take my example. Imagine you already have an analysis of all possible 1. d4 games. And start with 1. e4. You come up with 1.e4 e6 2. d4 and see this position already occured in your 1.d4 analysis... So you don't need to calculate <anything> of this branch! In other words, you ruled out zillions of games while you generated only one position.
Feb-24-14  RedShield: But to see that a position has already occurred you - or the mindless computer - has to generate it to understand that there was no need to generate it in the first place.
Premium Chessgames Member
  HeMateMe: Yep, mainland china is putting the screws into Hong Kong, despite promises that they would have free press, after England left.


Feb-24-14  RedShield: Did you mix up Ken Regan with Ken Rogoff?
Premium Chessgames Member
  alexmagnus: <Red> But you generate only <one> position - and exclude <many> games by having generated it. In this case, all games starting with 1.e4 e6 2.d4. You don't have to generate any of the positions/games starting with this sequence anymore. While they are still there in that 10^120 calculation.
Feb-24-14  RedShield: < But you generate only <one> position >

Yes, but you've generated it twice.

<You don't have to generate any of the positions/games starting with this sequence anymore.>

But you've generated them already.

Premium Chessgames Member
  alexmagnus: <But you've generated them already.> But I didn it once. While in the 10^120 calculation they are taken twice.

I don't know how many calculations are necessary to compile a 32 piece TB, but with this reasoning it will be only slightly bigger than the number of legal positions. So it will be closer to 10^46 than 10^120.

Premium Chessgames Member
  Stonehenge: Interview:

search thread:   
< Earlier Kibitzing  · PAGE 2 OF 2 ·  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.

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, 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-2021, Chessgames Services LLC