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.
  • Hackerrank Home
  • Prepare
    NEW
  • Certify
  • Compete
  • Career Fair
  • Hiring developers?
  1. All Contests
  2. ProjectEuler+
  3. Project Euler #237: Tours on a 4 x n playing board
  4. Discussions

Project Euler #237: Tours on a 4 x n playing board

Problem
Submissions
Leaderboard
Discussions

    You are viewing a single comment's thread. Return to all comments →

  • sjeuler
    3 years ago+ 1 comment

    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.

    1|
    Permalink
  • Contest Calendar
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Support
  • Careers
  • Terms Of Service
  • Privacy Policy
  • Request a Feature