We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
I think the people who solved this should get together and publish it in some math or algorithm journal. Also the rating might need to be upgraded a little bit to expert or fiendish for example! Of course that makes it all the more satisfying when finally solved! Just to get people thinking: use a recurrence or enumerate state combinations seems to be the question here.
Project Euler #237: Tours on a 4 x n playing board
You are viewing a single comment's thread. Return to all comments →
I think the people who solved this should get together and publish it in some math or algorithm journal. Also the rating might need to be upgraded a little bit to expert or fiendish for example! Of course that makes it all the more satisfying when finally solved! Just to get people thinking: use a recurrence or enumerate state combinations seems to be the question here.