Maze generation

[Terry Monks]

> In article <1990Dec13.190759.9297 at craycos.com> scott at craycos.com (Scott Bolte) writes:
> >
> >char*M,A,Z,E=40,J[40],T[40];main(C){for(*J=A=scanf(M="%d",&C);
> >--            E;             J[              E]             =T
> >[E   ]=  E)   printf("._");  for(;(A-=Z=!Z)  ||  (printf("\n|"
> >)    ,   A    =              39              ,C             --
> >)    ;   Z    ||    printf   (M   ))M[Z]=Z[A-(E   =A[J-Z])&&!C
> >&    A   ==             T[                                  A]
> >|6<<27<rand()||!C&!Z?J[T[E]=T[A]]=E,J[T[A]=A-Z]=A,"_.":" |"];}
> 


works fine on a Sun Sparcstation...

-- 
Terry Monks        Automata Design Inc    (703) 472-9400