Search for a tool
Lattice Path

Tool to calculate all paths on a grid graph. A path is a series of directions (north, south, east, west) to connect two points on a grid.

Results

Lattice Path -

Tag(s) : Graph Theory

dCode and you

dCode is free and its tools are a valuable help in games, puzzles and problems to solve every day!
You have a problem, an idea for a project, a specific need and dCode can not (yet) help you? You need custom development? Contact-me!

Team dCode read all messages and answer them if you leave an email (not published). It is thanks to you that dCode has the best Lattice Path tool. Thank you.

# Lattice Path

## Path Count Calculator (North-East - NE)

The information on this page is for a square grid and is not valid on triangular grids (or other non square lattice graphs).

### Between 2 points

Tool to calculate all paths on a grid graph. A path is a series of directions (north, south, east, west) to connect two points on a grid.

### How to count paths on a lattice graph?

The calculation of the number of paths (of length $$a + b$$) on a grid of size (a x b) (limited to a north-south direction and a west-east direction) uses the binomial coefficient $$\binom{a+b}{a}$$

The north direction N consists of moving up one unit along the ordinate (0,1).

The east direction E consists of moving one unit to the right along the abscissa (1,0).

Example: To go from the point $$(0, 0)$$ to the point $$(2, 2)$$ (which corresponds to a 2x2 grid) using only north and east. (N,N,E,E), (N,E,N,E), (N,E,E,N), (E,N,E,N), (E,N,N,E), (E,E,N,N) so 6 paths and is computed $$\binom{4}{2} = 6$$