Monday May 6, 2013
This problem challenges you to discover algorithm(s) to simplify and solve a well defined logic puzzle, given that for a contest lasting only a few hours, a brute force algorithm could take days of run-time to complete.
This problem is inspired by Project Euler 185: http://projecteuler.net/problem=185

This problem is like the Project Euler problem, except instead of numbers, lowercase letters are used. The integer following each sequence of 15 letters reflects the number of correct letters in the correct position.

You are given this list of test patterns:
whatanswersbein 3
ithecareemplore 3
befreedjustlike 0
howsailoronceto 2
windsaidfreedom 1
vvvvvvvvvvvvvvv 0
naryawordharmed 2
viaourmakingall 2
vvvvvvvvvvvvvvv 0
patternsofgreat 2
worthneedseento 1
beelsefriendnot 0
willtimebetoyou 0
vvvvvvvvvvvvvvv 0
abandonnohopeor 1
startyounotthis 1
taskofmindheart 1
vvvvvvvvvvvvvvv 0
sphinxofblackqu 2
artzjudgemyvowq 1
uickzephyrsblow 0
vexingdaftjimpa 1
ckmyboxwithfive 0
dozenliquorjugs 1
wequicklyseized 0
theblackaxleand 2
justsaveditfrom 1
goingpasthimthe 2
quickbrownfoxju 0
mpsoveralazydog 1

This problem could have 0, just 1, or possibly many solutions. Your job is to find the solutions.
Show solution
Challenge Resources:
©1994-2014   |   Shodor   |   Privacy Policy   |   NSDL   |   XSEDE   |   Blue Waters   |   ACM SIGHPC   |   facebook  |   facebook   |   twitter   |   rss   |   youtube Not Logged In. Login