You are viewing a single comment's thread. Return to all comments →
When dice are at their furthest distance there are three options for the change in distance: stay the same, reduce by one or reduce by two.
In this problem there are a finite number of states and there is an exact solution.
I’ve written a few ideas down which should point you in the right direction for solving this one: https://www.jamespking.com/posts/hackerrank-projecteuler-227-writeup/
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #227: The Chase
You are viewing a single comment's thread. Return to all comments →
When dice are at their furthest distance there are three options for the change in distance: stay the same, reduce by one or reduce by two.
In this problem there are a finite number of states and there is an exact solution.
I’ve written a few ideas down which should point you in the right direction for solving this one: https://www.jamespking.com/posts/hackerrank-projecteuler-227-writeup/