• Advanced
  • About 16 min

Paths on a grid: lattice routes, forced points and forbidden points

Count the shortest routes from one corner of a grid to another with C(m + n, m), force a route through a point, forbid a point, and count routes that never cross the diagonal.

If something looks wrong, please tell us.

This lesson is part of a premium course. It comes with Sikhora Learning membership. The course's free preview lessons are open to everyone.

Privacy · Terms · Refunds · Delivery