Dynamic programming: never solve the same thing twiceLesson 1 of 6Free preview
Counting routes around a procession
A procession closes the centre block of a 3 by 3 grid: 2 routes survive. Each block adds the routes from above and from the left.
Dynamic programming: never solve the same thing twiceLesson 1 of 6Free preview
A procession closes the centre block of a 3 by 3 grid: 2 routes survive. Each block adds the routes from above and from the left.