![]() |
November 2018
[URL]http://www.research.ibm.com/haifa/ponderthis/challenges/November2018.html[/URL]
Minimal substrings. Fun! |
[QUOTE=Batalov;499211][URL]http://www.research.ibm.com/haifa/ponderthis/challenges/November2018.html[/URL]
Minimal substrings. Fun![/QUOTE] My main difficulty in code would be connecting them up correctly. Minimal possible length for it to go to is 256. |
I cannot imagine that there is a 256-letter-string containing 252 different anagrams, if in the exemple 13 are needed instead of 12 (I suppose that 13 is the best solution).
The best 270-letter-string I have found until now contains 249 different anagrams. |
Same procedure as last month - only 17 solvers until now. I have found some 270-letter-strings containing 251 different anagrams, but I continue to seek...
|
I really should email my results.
|
[url]http://www.research.ibm.com/haifa/ponderthis/solutions/November2018.html[/url]
|
| All times are UTC. The time now is 03:36. |
Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2021, Jelsoft Enterprises Ltd.