User: johntromp

Re:Puny compared to the complexity of Go.

On: Chess - 2070 CPUs vs 1 GM

With a sensible rule like Superko (You cannot move to a position which has previously occured), Go games CANNOT go on for infinity. They can however easily go on for 2**155 * 206, or about 10**49 moves, as explained on http://senseis.xmp.net/?path=Speculation&page=Numb erOfPossibleOutcomesOfAGame -John

fanless pc with dvi-output

On: Small Form Factor Comparison Matrix

I'd like to have a small silent box on
my desk that can drive an lcd display the
way it was meant: digitally. Unfortunately,
VIA's epia boards do not provide DVI output.
This leaves the Hush Technologies fanless
ATX box with PCI graphics as the next best
solution, but at nearly $2000, it's not exactly
a bargain.
Does anyone know of any cheaper solutions?

regards,

%!PS % -John Tromp (http://www.cwi.nl/~tromp/)
42 42 scale 7 9 translate .07 setlinewidth .5 setgray/c{arc clip fill
setgray}def 1 0 0 42 1 0 c 0 1 1{0 3 3 90 270 arc 0 0 6 0 -3 3 90 270
arcn 270 90 c -2 2 4{-6 moveto 0 12 rlineto}for -5 2 5{-3 exch moveto
9 0 rlineto}for stroke 0 0 3 1 1 0 c 180 rotate initclip}for showpage

Re:not that you need recursion for this...

On: 108 Ways To Do The Towers of Hanoi

/* oops, forgot to format as code.
it should've looked like:
*/

max = 1 << no_of_discs;
for (x = 1; x < max; x++)
printf("move a disc from %d to %d\n", (x&x-1)%3, ((x|x-1)+1)%3);

not that you need recursion for this...

On: 108 Ways To Do The Towers of Hanoi

max = 1 no_of_discs;
for (x = 1; x max; x++)
printf("move a disc from %d to %d\n", (x&x-1)%3, ((x|x-1)+1)%3);

Investment sink been around since 1997

On: Israeli Firm Claims Unbreakable Encryption

Check out http://web.archive.org/web/*/http://www.meganet.co m for a great source of amusement.

Curiously, all of their challenges are over before ever appearing on their website...