(adsbygoogle = window.adsbygoogle || []).push({}); 1. The problem statement, all variables and given/known data

Starting in the bottom left corner and moving either up or right, one square at a time, adding up the numbers along the way, what is the largest sum that can be made once you have reached the top right corner

142212

431343

214212

122331

413121

314342

211113

342322

This is from an "intro to computer science" course. My prof was a bit of a lazy bastard and just threw these random technical questions into the mix with the knowledge questions without giving us homework solutions or anything you could call teaching beyond, "it's just graph theory" in class.

2. Relevant equations

3. The attempt at a solution

no idea.

Thanks for looking.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Homework Help: Easy graph theory question: maximise sum of visited nodes

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

**Physics Forums | Science Articles, Homework Help, Discussion**