Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!sdd.hp.com!spool.mu.edu!uunet!math.fu-berlin.de!opal!unido!unidui!flyer!easix!channelz!swildner
From: swildner@channelz.gun.de (Sascha Wildner)
Newsgroups: comp.sys.amiga.graphics
Subject: "4096 in a row" again...
Message-ID: <swildner.3336@channelz.gun.de>
Date: 27 Mar 91 18:01:23 GMT
Article-I.D.: channelz.swildner.3336
Organization: Private
Lines: 29

Hi!
It  seems that my description of what I wanted wasn't that clear. Now that I
have  found  the  solution (thanks Holger!) here's what I meant (for all the
people who can't sleep at night thinking "what the hell did that guy want?":

I  searched  a  way  to  put  all 4096 colors in an order so that Color[n+1]
differs from Color[n] by a modification of only ONE of the three components.

Here's the solution:

000,001,002,003...00F,01F,01E,01D...010,020,021,022...0F2,0F1,0F0,1F0,1F1,1F2,
1F3,1F4,1F5,1F6...1FF,1EF...

Quite simple, eh? Don't know if that's what many people who answered called
"grey  code",  but that's exactly what I was looking for. Thanks to all who
answered, anyway (I am working on my ability to describe things in english,
lads!).


--


       +---------------------------------------------------------------+
       | Sascha Wildner, Am Druvendriesch 27, W-5030 Huerth 6, Germany |
       |                                                               |
       | Phone   : +49 2233 15571   Zerberus: S.WILDNER@TBC.ZER        |
       | MagicNet: DINO-BOX:BILBO   UUCP    : swildner@channelz.gun.de |
       | Fido    : 2:241/5008                                          |
       +---------------------------------------------------------------+