A Map-Folding Problem


An algorithm is described to compute the number of ways of folding a one-dimensional map, and a table of values given. Introduction. In how many ways can a map be folded up? What follows is restricted to the one-dimensional problem, that is : Given a plane chain ('map') of p equal segments ('leaves') jointed together, in how many ways ('p-foldings') G(p… (More)