I'm trying to solve this problem -> http://www.hpcodewars.org/past/cw2/problems/PROB15.HTM.
Or should I say I'm completely unable to generate any ideas how to solve it, so I'd like to have some guidance on what to read or what kind of technique to use. I don't want a solution just some guidance. Thanks in advance!
gmunk
0
Newbie Poster
Recommended Answers
Jump to PostWell, you know that sum(each visited node) == node(3,3), so you can work the problem backward: There are two legal cells adjacent to (3,3): (3,2) and (2,3). The sum just prior to reaching those cells would have to be (3,3) - (that cell). And so forth backward. You can prune …
All 4 Replies
Reply to this topic
Be a part of the DaniWeb community
We're a friendly, industry-focused community of developers, IT pros, digital marketers, and technology enthusiasts meeting, networking, learning, and sharing knowledge.