[Retros] Mushikui Reconstruction mathematical(+retro) question

[Juha Saukkola]

Nice question:
What's the longest string for one move?
And how many different moves of that length exist?

 
From: tsai39 at illinois.edu
To: retros at janko.at
Date: Sun, 22 May 2011 18:43:03 -0500
Subject: Re: [Retros] Mushikui Reconstruction (completely unknown moves)


> 1.? ** 2.**** **** 3.? ***** 4.** ***** 5. **** ? 6. ****** **** 7. *****

>

> This example has 13 single moves and 3 question marks, so I shall define 

> its

> "question mark density" to be 3/13.

>

> Needless to say, a new open quest I will leave to you is to find a 

> sequence

> with the highest question mark density!

 
 
Oops. I suddenly realize that the part up to the seventh single moves can be 
modified into
 
1.? ? 2.**** **** 3.? ***** 4.**
 
This has a higher question mark density 3/7. Just a remark :)
 
 
There's one more challenge for everybody:
 
Find a mushikui sequence, so that you may replace the most number of 
consecutive moves into question marks!
 
For example, the one above has two consecutive question marks.
 
 
Mu-Tsun 
 

_______________________________________________ Retros mailing list Retros at janko.at http://www.pairlist.net/mailman/listinfo/retros 		 	   		  
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.pairlist.net/pipermail/retros/attachments/20110523/1238d44f/attachment.htm>