Anonymous user
Talk:Best shuffle: Difference between revisions
→Task Description: suggested task description change
(→Task Description: adjust task description?) |
(→Task Description: suggested task description change) |
||
Line 13:
:: I'm going to play devils advocate on the words here. The task says "as many of the character values are in a different position as possible" which seems clear to me that this means as few coincidences of characters by position. While "an organization as distant from the original organization as possible" could be taken as an arrangement where the characters are also far away from their original position. I don't see any of the solutions addressing that metric. I think either approach could be deterministic. I do admit that "shuffle" implies some randomness. (The Icon solution has a commented out line for this since it wasn't clear at the time). Some of the other solutions may have trouble adapting (not sure). If it's late in the game to clarify, could randomness be an extra points type requirement? --[[User:Dgamey|Dgamey]] 13:53, 15 May 2011 (UTC)
::: I think that's a good idea. Having more than one approach is more interesting anyway. English is not my native language. Maybe somebody could adjust the task description. I don't want to risk creating more confusion :) [[User:Fwend|Fwend]] 14:24, 15 May 2011 (UTC)
::::Okay, how about something like this "Shuffle the characters of a string in such a way that as many of the character values are in a different position as possible. Print the result as follows: original string, shuffled string, (score). \n\nWhere the score the number of characters that remain in their original position. The better the shuffle the smaller the score. \n\nAs there are often multiple solutions that achieve the lowest score, for extra points include or show how to achieve randomization amongst these lowest scoring results." --[[User:Dgamey|Dgamey]] 03:12, 16 May 2011 (UTC)
== J implementation notes ==
| |||