Enumeration of Standard Puzzles
We introduce a large family of combinatorial objects, called standard puzzles, defined by very simple rules. We focus on the standard puzzles for which the enumeration problems can be solved by explicit formulas or by classical numbers, such as binomial coefficients, Fibonacci numbers, tangent numbers, Catalan numbers, $\ldots$