MatPlus.Net

 Website founded by
Milan Velimirović
in 2006

0:13 UTC
ISC 2024
 
  Headlines
  Forum*
  Fellows
  Members
  DL Archive
  Links

Username:

Password:

Remember me

 
Forgot your
password?
Click here!
SIGN IN
to create your account if you don't already have one.
CHESS
SOLVING
Tournaments
Rating lists
1-Oct-2024

B P C F





 		 
MatPlus.Net Forum Internet and Computing Another study/Nalimov question
 
You can only view this page!
(1) Posted by Hauke Reddmann [Tuesday, Dec 16, 2008 15:09]

Another study/Nalimov question


What is the longest chain of unique winning moves in a study?
(Can be Nalimov-proven, otherwise YOU must prove it. :-)
We assume tacitly Black isn't helping too much; he doesn't have
to play the optimum move but at last he tries to defend.)

Hauke
 
(Read Only)pid=3006
No more posts


MatPlus.Net Forum Internet and Computing Another study/Nalimov question