Newsgroups: comp.ai.games
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!news.mathworks.com!uunet!in1.uu.net!newsflash.concordia.ca!news.mcgill.ca!clouso.crim.ca!athena.ulaval.ca!ppp-B11.ulaval.ca!loiselse
From: loiselse@ift.ulaval.ca (Sebastien Loisel)
Subject: Re: "The Shortest Route"
Message-ID: <loiselse.166.0011D231@ift.ulaval.ca>
Lines: 12
Sender: news@athena.ulaval.ca
Nntp-Posting-Host: ppp-b11.ulaval.ca
Organization: Universite Laval
X-Newsreader: Trumpet for Windows [Version 1.0 Rev A]
References: <1995Mar13.231632.13723@blaze.trentu.ca> <TORMY.95Mar14124452@signy11.stud.unit.no> <3ki16b$3aj@math.rutgers.edu> <3knrrf$a26@belfort.daimi.aau.dk> <D5uFpI.H7D@cs.dal.ca>
Date: Fri, 24 Mar 1995 22:49:08 GMT

In article <D5uFpI.H7D@cs.dal.ca> conrad@ug.cs.dal.ca (Blair Conrad) writes:
[SNIP]
>: [1 byte/path, 100*100 field => (10000^2 - 10000)/2 * 1 byte ~ 50 MB]

>Actually, probably a bit worse than that, since 1 byte probably wouldn't
>be enough to represend a path...

I needed 4 bits to store a "whole path". I really just stored which of the 8 
surrounding squares you should go next (and sometimes, there is no path so 
I used an extra bit).

Zed
