====== The Map Folding problem ======

The //Map Folding Problem// refers to the question of how many ways there are to fold a rectangular map along its (valley and peak) creases. (It's a companion of the //Stamp Folding Problem//, first described in 1891.)

For example : There are eight ways to fold a 2 × 2 map along its creases, counting each different vertical sequence of folded squares as a distinct way of folding the map.

However :

>__[...[ the general problem of counting the number of ways to fold a map remains unsolved. __The numbers of ways of folding an //n// × //n// map are known only for //n ≤ 7 //\\ \\ Source : [[https://en.wikipedia.org/wiki/Map_folding|Wikipedia]]

Further technical information : [[https://www.ams.org/journals/mcom/1968-22-101/S0025-5718-1968-0221957-8/S0025-5718-1968-0221957-8.pdf|Math. Comp. 22 (1968), 193-199 ]]