The included code and white paper provides a parallel solution for enumerating Delannoy paths visualized as paths of a taxi through a grid of city streets. The code solves the problem through recursive enumeration of all possible permutations. A dynamic partitioning scheme is used to achieve good load balance and task granularity. Parallelism is implemented with Pthreads.
DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.