samsloan
2012-11-09 10:35:02 UTC
Dr. Lasker's Chess Career 1889-1914
by Fred Reinfeld and Reuben Fine
Introduction by Sam Sloan
This was the first book by Reuben Fine and one of the first, if not
the very first, by Fred Reinfeld.
Both were young men. Fine was 21. Reinfeld was 24.
Both went on to become not only strong chess players but prolific
writers of books, especially Reinfeld who wrote more than one hundred
chess books. Both Fine and Reinfeld became noted authors of books on
other subjects as well. Reinfeld wrote more than fifty books on other
subjects such as checkers, coin collecting and stamp collecting. Fine
wrote college textbooks on psychology and psychoanalysis.
Dr. Lasker's Chess Career 1889-1914 has become a rare book, almost
impossible to obtain. I bought the book used for this reprint from a
collector of rare books in Denmark.
The original title was Dr. Lasker's Chess Career, Part I, 1889-1914.
This was obviously intended to be the first in a series of books about
World Chess Champion Emanuel Lasker (1868-1941). Since this book was
written in 1935, Emmanuel Lasker was still alive. However no other
volume of this book was ever written, so I have shortened the title to
just Dr. Lasker's Chess Career 1889-1914.
Emanuel Lasker burst on the chess scene by winning his first
tournament in 1888-1889 at the age of 20. He then won several
tournaments and played a series of matches in 1889-1893 against some
of the strongest players in the world, winning them all. However, when
he challenged the World Chess Champion Wilhelm Steinitz to a match in
1894, it was believed that he stood no chance. The world was shocked
when he defeated Steinitz and became World Chess Champion, a title he
held for the next 27 years until he lost to Capablanca in 1921.
It has long been said that Emanuel Lasker was a coffee-house player
who deliberately played week moves in order to psyche out his
opponents. However, we now need to revaluate this assessment. Computer
Scientist and International Chess Master Ken Regan did a computer
analysis of the moves of modern and historical chess grandmasters to
see which player's moves most closely matched the moves of a strong
modern computer. The reason for these tests was to detect computer
cheating. Nowadays many computer programs are stronger than any human
in the world, so if a human player consistently picks moves that a
computer also picks, that might be evidence that the player is
computer cheating.
This was reported in the New York Times in an article dated March 19,
2012 entitled “Chess Players Whose Moves Most Matched Computers”. This
program was developed in response to a complaint that during the
Kramnik-Topalov Match in 2006 for the World Chess Championship when
Kramnik was spending most of his time in the toilet when it was his
move. This became known as the Toiletgate Affair. It was alleged that
Kramnik was using a computer hookup in the toilet to get his moves.
As it turned out here was insufficient evidence that either Kramnik or
Topalov had cheated. However, there was strong conformation that a
known and convicted cheater Sébastien Feller of France had cheated in
the Paris Open. Feller has since been suspended by FIDE from competing
in chess tournaments.
What was surprising is the grandmasters who moves most closely matched
the computer. At the top of the list was Zsuzsa (“Susan”) Polgar,
whose moves in her match against Xie Jun wherein she won the World
Woman's Chess Championship in 1996 most closely matched the computer.
This has raised questions about whether Polgar's victory in that match
was computer-aided. Polgar has since been expelled from the United
States Chess Federation for other reasons. She has also been banned
from computer chess websites such as the Internet Chess Club.
What is surprising here is the historical player whose moves most
closely marched the computer was none other than Emanuel Lasker. This
is based on the Lasker-Marshall Match of 1907 and the Lasker
Schlechter Match of 1910.
Here is the list:
http://www.cse.buffalo.edu/~regan/chess/fidelity/WCallperfs.txt
As you can see, among the historical players who lived before the
invention of computers, Emanuel Lasker is first, followed by
Botvinnik, then Fischer, then Alekhine and Euwe.
So from this we can see that the claim that Emanuel Lasker
deliberately made weak moves was invalid. Rather the moves he made
were deeper and more profound than anybody at the time realized.
By the way, Emanuel Lasker could not have been a computer cheat
because computers did not exist when he was alive. Lasker died on
January 11, 1941. The first computer capable of playing a full game of
chess was in 1957. The first computer capable of beating a master came
in 1981. The first time that a computer defeated the World Champion in
a match was in 1997.
Sam Sloan
ISBN 4871875318
http://www.amazon.com/dp/4871875318
http://search.barnesandnoble.com/books/product.aspx?ISBN=4871875318
by Fred Reinfeld and Reuben Fine
Introduction by Sam Sloan
This was the first book by Reuben Fine and one of the first, if not
the very first, by Fred Reinfeld.
Both were young men. Fine was 21. Reinfeld was 24.
Both went on to become not only strong chess players but prolific
writers of books, especially Reinfeld who wrote more than one hundred
chess books. Both Fine and Reinfeld became noted authors of books on
other subjects as well. Reinfeld wrote more than fifty books on other
subjects such as checkers, coin collecting and stamp collecting. Fine
wrote college textbooks on psychology and psychoanalysis.
Dr. Lasker's Chess Career 1889-1914 has become a rare book, almost
impossible to obtain. I bought the book used for this reprint from a
collector of rare books in Denmark.
The original title was Dr. Lasker's Chess Career, Part I, 1889-1914.
This was obviously intended to be the first in a series of books about
World Chess Champion Emanuel Lasker (1868-1941). Since this book was
written in 1935, Emmanuel Lasker was still alive. However no other
volume of this book was ever written, so I have shortened the title to
just Dr. Lasker's Chess Career 1889-1914.
Emanuel Lasker burst on the chess scene by winning his first
tournament in 1888-1889 at the age of 20. He then won several
tournaments and played a series of matches in 1889-1893 against some
of the strongest players in the world, winning them all. However, when
he challenged the World Chess Champion Wilhelm Steinitz to a match in
1894, it was believed that he stood no chance. The world was shocked
when he defeated Steinitz and became World Chess Champion, a title he
held for the next 27 years until he lost to Capablanca in 1921.
It has long been said that Emanuel Lasker was a coffee-house player
who deliberately played week moves in order to psyche out his
opponents. However, we now need to revaluate this assessment. Computer
Scientist and International Chess Master Ken Regan did a computer
analysis of the moves of modern and historical chess grandmasters to
see which player's moves most closely matched the moves of a strong
modern computer. The reason for these tests was to detect computer
cheating. Nowadays many computer programs are stronger than any human
in the world, so if a human player consistently picks moves that a
computer also picks, that might be evidence that the player is
computer cheating.
This was reported in the New York Times in an article dated March 19,
2012 entitled “Chess Players Whose Moves Most Matched Computers”. This
program was developed in response to a complaint that during the
Kramnik-Topalov Match in 2006 for the World Chess Championship when
Kramnik was spending most of his time in the toilet when it was his
move. This became known as the Toiletgate Affair. It was alleged that
Kramnik was using a computer hookup in the toilet to get his moves.
As it turned out here was insufficient evidence that either Kramnik or
Topalov had cheated. However, there was strong conformation that a
known and convicted cheater Sébastien Feller of France had cheated in
the Paris Open. Feller has since been suspended by FIDE from competing
in chess tournaments.
What was surprising is the grandmasters who moves most closely matched
the computer. At the top of the list was Zsuzsa (“Susan”) Polgar,
whose moves in her match against Xie Jun wherein she won the World
Woman's Chess Championship in 1996 most closely matched the computer.
This has raised questions about whether Polgar's victory in that match
was computer-aided. Polgar has since been expelled from the United
States Chess Federation for other reasons. She has also been banned
from computer chess websites such as the Internet Chess Club.
What is surprising here is the historical player whose moves most
closely marched the computer was none other than Emanuel Lasker. This
is based on the Lasker-Marshall Match of 1907 and the Lasker
Schlechter Match of 1910.
Here is the list:
http://www.cse.buffalo.edu/~regan/chess/fidelity/WCallperfs.txt
As you can see, among the historical players who lived before the
invention of computers, Emanuel Lasker is first, followed by
Botvinnik, then Fischer, then Alekhine and Euwe.
So from this we can see that the claim that Emanuel Lasker
deliberately made weak moves was invalid. Rather the moves he made
were deeper and more profound than anybody at the time realized.
By the way, Emanuel Lasker could not have been a computer cheat
because computers did not exist when he was alive. Lasker died on
January 11, 1941. The first computer capable of playing a full game of
chess was in 1957. The first computer capable of beating a master came
in 1981. The first time that a computer defeated the World Champion in
a match was in 1997.
Sam Sloan
ISBN 4871875318
http://www.amazon.com/dp/4871875318
http://search.barnesandnoble.com/books/product.aspx?ISBN=4871875318