|
< Earlier Kibitzing · PAGE 1 OF 2 ·
Later Kibitzing> |
| Jun-22-06 | | Caissanist: See also Regan Kenneth and Regan Kenneth (USA). IM Kenneth Regan was one of dozens of very strong US juniors to emerge during the seventies "Fischer boom". He was known for his adventurous openings--Regan once beat Walter Browne with 1.e4 b6. |
|
| Aug-10-07 | | Maynard5: Ken Regan is now a professor of computer science and engineering, who has written some fine papers on complex systems. Here is the link to his website at the University: www.cse.buffalo.edu/~regan/ |
|
| Jul-01-08 | | jrofrano: he recently won the 2nd annual 2008 mayors cup
http://buffalochess.blogspot.com/20... he played extremely well and had a good tournament and went +5 -0 =0. |
|
| Dec-17-08 | | WhiteRook48: Is this guy Ronald Reagan? |
|
| 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 |
|
Mar-16-09
 | | 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. |
|
Sep-13-10
 | | 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: http://www.nytimes.com/2012/03/20/s... . |
|
| 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. |
|
May-28-13
 | | 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:
http://rjlipton.wordpress.com/2013/... |
|
| 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: http://www.cse.buffalo.edu/~regan/ |
|
| 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 Chessgames.com
Dedicated to Dr. Kenneth Regan on his Birthday
White to Play and Mate in Three
click for larger viewA 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 viewYou'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: http://www.cse.buffalo.edu/~regan/p... 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 (http://www.scottaaronson.com/democr...) 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!> http://www.chessninja.com/dailydirt... |
|
Feb-22-14
 | | 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? |
|
Feb-24-14
| | 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. |
|
Feb-24-14
 | | HeMateMe: Yep, mainland china is putting the screws into Hong Kong, despite promises that they would have free press, after England left. <http://www.cnn.com/2014/02/24/world...> |
|
| Feb-24-14 | | RedShield: Did you mix up Ken Regan with Ken Rogoff? |
|
 |
|
< Earlier Kibitzing · PAGE 1 OF 2 ·
Later Kibitzing> |
Kibitzing
