Date: Feb 5, 2013 12:56 AM
Author: fom
Subject: Re: Continous path on square grid
On 2/4/2013 7:38 PM, clive tooth wrote:

> On Feb 1, 12:11 pm, 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?

>

> I wrote a program to tackle this and I have now found a P(5,8).

>

Assuming that that photo of the P(3,4) was yours,

will you be posting it?