Path: utzoo!utgpu!cs.utexas.edu!wuarchive!uunet!van-bc!mdivax1!mitchell Newsgroups: alt.sources Subject: Re: VI SOLVES MAZE (update) Message-ID: <1991Jan15.152101.2935@mdivax1.uucp> Date: 15 Jan 91 15:21:01 GMT References: <2164@otc.otca.oz> <1991Jan15.062435.22908@nntp-server.caltech.edu> Reply-To: mdivax1!bb29c!mitchell (Bill Mitchell) Organization: Mobile Data International Lines: 26 Return-Path: Apparently-To: van-bc!rnews In article <1991Jan15.062435.22908@nntp-server.caltech.edu> antonyc@nntp-server.caltech.edu (Bill T. Cat) writes: >gregm@otc.otca.oz.au (Greg McFarlane) writes: > >>Anyone who can't get the maze.c file to compile, get a new compiler. > >i was playing with the maze.c thing, and the problem with it on >most systems is that it is not ansi compatible. so, the nerd that >i am, i fixed it for ansi. it's not quite as pretty, but hey, it works. > > > char*M,A,Z,E=40,J[80],T[3];main(C){for(M=J+E,*J=A=scanf("%d",& > C) ;-- E;J [E ]=M > [E ]= E) printf("._"); for(;(A-=Z=!Z) || (printf("\n|" > ) , A = 39 ,C -- > ) ; Z || printf (T ))T[Z]=Z[A-(E =A[J-Z])&&!C > & A == M[ A] > |6<<11