Waste less time on Facebook — follow Brilliant.

Grid walking without touch an area

I'm trying to solve this problem

I have read the grid walking section on combinatorics even though I cannot even get the result for the examples cases.

Can you help me?

Note by Jesús Saucedo
1 year, 5 months ago

No vote yet
1 vote


Sort by:

Top Newest

It's easier tou count one-by-one the paths that satisfy the conditions. There are just 27.

Mateo Matijasevick - 1 year, 5 months ago

Log in to reply


Problem Loading...

Note Loading...

Set Loading...