|
![](/i/fill.gif) |
Philippe Debar wrote:
>
> ;-)
>
> > Now find the number such that a path can't intersect itself. ;)
>
> I count 486 of them. (Actually my pov-code counts them, I just repeat
> dumbly... Humans don't do mistake, they merely do whatever the computers
> tell them.)
>
> I currently believe that there are 81 different paths, the others are just
> rotations/symetries of these.
486 divided by three rotations, two reflections, that seems to be right.
I think there's 72 if you are confined to the surface of the cube, no
going to the opposite corner.
--
David Fontaine <dav### [at] faricy net> ICQ 55354965
My raytracing gallery: http://davidf.faricy.net/
Post a reply to this message
|
![](/i/fill.gif) |