Suppose that you have a square (N x N) grid and want to determine number of unique paths, which will take you from the top left corner in the grid to the bottom right one of if. You are allowed to move by one point at at time, and to the right or to the bottom only. For example, ...

Suppose, that you were born on Monday, January 1, and want to know how many Mondays happened to fall on the same day of any month of the year over, lets say, the last 100 years. It is a silly problem, but also one which points to some problems and inaccuracies ensuing from ...

This article is a follow-up to my text about turning a pyramid like structure into a graph (which looks a lot like a tree, but isn't one), finding all the paths in the graph and collecting all the values held by vertices in each path of it. In the first article I stopped at ...

Suppose you have a structure like one shown below, lets call it pyramid, and are asked to find all the paths from top to bottom in it, and perhaps also to do something with values of nodes in each path, add them or find their product etc. . How do you achieve these things? In ...