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!

This page is using the new English version of dCode, please make comments !

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.

Answers to Questions

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} \)

> 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 \)

Ask a new question

Source code

dCode retains ownership of the source code of the script Lattice Path. Except explicit open source licence (indicated Creative Commons / free), any algorithm, applet, snippet, software (converter, solver, encryption / decryption, encoding / decoding, ciphering / deciphering, translator), or any function (convert, solve, decrypt, encrypt, decipher, cipher, decode, code, translate) written in any informatic langauge (PHP, Java, C#, Python, Javascript, etc.) which dCode owns rights can be transferred after sales quote. So if you need to download the Lattice Path script for offline use, for you, your company or association, see you on contact page !

dCode uses cookies to customize the site content, analyze user behavior and adapt dCode to your use. Some data is stored and collected for advertising purposes and may be shared with our partners. OK