Block walking
In combinatorial mathematics, block walking is a method useful in thinking about sums of combinations graphically as "walks" on Pascal's triangle. As the name suggests, block walking problems involve counting the number of ways an individual can walk from one corner A of a city block to another corner B of another city block given restrictions on the number of blocks the person may walk, the directions the person may travel, the distance from A to B, et cetera.
Wikipage redirect
primaryTopic
Block walking
In combinatorial mathematics, block walking is a method useful in thinking about sums of combinations graphically as "walks" on Pascal's triangle. As the name suggests, block walking problems involve counting the number of ways an individual can walk from one corner A of a city block to another corner B of another city block given restrictions on the number of blocks the person may walk, the directions the person may travel, the distance from A to B, et cetera.
has abstract
In combinatorial mathematics, ...... stance from A to B, et cetera.
@en
Wikipage page ID
Wikipage revision ID
649,446,149
subject
hypernym
type
comment
In combinatorial mathematics, ...... stance from A to B, et cetera.
@en
label
Block walking
@en