On 1 Feb, 13:11, clive tooth <cli...@gmail.com> wrote: > Let a P(n,s) be a continuous path, made of s straight sections, which > passes exactly once through each of n^2 points arranged in a square > array. > > So, here is a P(3,4)...http://www.flickr.com/photos/lhc_logs/8435448440/in/photostream > > I know of a P(4,6). But I cannot find a P(5,8). Any takers? > > -- > Clive Tooth
Can i ask what what type of real problems this solves, or is it just like puzzles?