[mdaniel]

I'm not them, but I think it's a variation of the subset-sum problem

If we modify the question to be "sum to 100" (to just seriously reduce the number of example boxes required) then given:

  | 50 | 20 | 24 |
  |  7 |  5 |  1 |
  | 51 | 51 | 51 |

the solution would be

  | [50] | [20] | [24] |
  |   7  | [ 5] | [ 1] |
  |  51  | 51   |  51  |

  | right | down  | win
  | X     | right | up
  | X     | X     | X

[Loughla]

Correct. That but for 1000. You can build your own with any number of online tools.

I don't have a link because it's part of a lesson plan set behind a payment on teachers pay teachers.

[int_19h]

Do you have a link to any of those online tools that can be used to generate a puzzle of equivalent complexity to the one that you've tested on?

[janalsncm]

The sum doesn’t even have to be 1000, just create a grid of random numbers, create a random path and find the sum. It’s an equivalent problem.