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.
[…[ 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 : Wikipedia
Further technical information : Math. Comp. 22 (1968), 193-199
Ideas for new topics, and suggested additions / corrections for old ones, are always welcome.
If you have skills or interests in a particular field, and have suggestions for Wikenigma, get in touch !
Or, if you'd like to become a regular contributor . . . request a login password. Registered users can edit the entire content of the site, and also create new pages.
( The 'Notes for contributors' section in the main menu has further information and guidelines etc.)
You are currently viewing an auto-translated version of Wikenigma
Please be aware that no automatic translation engines are 100% accurate, and so the auto-translated content will very probably feature errors and omissions.
Nevertheless, Wikenigma hopes that the translated content will help to attract a wider global audience.