Article View: rec.games.programmer
Article #544Re: Maze FAQ
From: Christopher Phillips
Date: Mon, 10 Aug 1992 10:15
Date: Mon, 10 Aug 1992 10:15
26 lines
1377 bytes
1377 bytes
>Technique #3: Kruskal's Algorithm >This is perhaps the most advanced of the maze generation algorithms, >requiring some knowledge of the union-find algorithm. It is also the >most fun to watch in progress! Can anyone post more details on the Union-find algorithm? I independantly came up with Kruskal's Algorithm when I needed less dendrity mazes than the ones you get from growing from a seed, but I had problems with finiding efficient ways of maintaining the equivalence sets. Ta. Christopher Jam (btw; to the FAQposter: Thankyou thankyou thankyou! Would you be able to post this on a regular basis? I had considered making one up myself with the frequency this topic comes up...) -- Christopher Jam __________________________________________________ 'Another day, another try. But remember, SHOOT OR DIE!' -turrican phillips@swanee.ee.uwa.oz.au c64 forever!!!! ------------------------------------------------------------------
Technical Details
Message-ID:
<phillips.713441744@infs4>Path:
arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!uniwa!swanee.ee.uwa.oz.au!phillipsReferences:
<UeV1Uvq00Vp2M2smUo@andrew.cmu.edu>Show Full Headers
Complete Article Headers
Newsgroups: rec.games.programmer Path: arc1-ca.pugleaf.net!sparky!uunet!munnari.oz.au!uniwa!swanee.ee.uwa.oz.au!phillips From: phillips@swanee.ee.uwa.oz.au (Christopher Phillips) Subject: Re: Maze FAQ Message-ID: <phillips.713441744@infs4> Sender: news@swanee.ee.uwa.oz.au Organization: Elec Eng, Univ of Western Australia References: <UeV1Uvq00Vp2M2smUo@andrew.cmu.edu> Date: 10 Aug 92 10:15:44 GMT Lines: 26