Board index » delphi » mazes
Student, T.U.E.
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
|
Student, T.U.E.
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
mazes
Hey there!
Could anyone help me with a maze constructing algorithm?? I'm trying to do a redo of the old Snipes game :) ?? |
Frank Peel
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesQuoteStudent, T.U.E. <YourN...@student.tue.nl> wrote in message Quote> Hey there! that program come from? I went looking for it some months back and couldn't find it. FP |
Martin Stah
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesQuoteFrank Peelo wrote: Germany it was sold with an other name. If I translated "maze" right, it means "Irrgarten" in german language, then I have a game named "3-Demon" (shareware). It was available from PC Research, Inc. shareware - 3D 8 Village Lane Colts Neck, NJ 07722 It cost in 1983 $10. You also could by the source code for $50. I hope this helps Martin |
Frank Pee
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesOn Wed, 12 Apr 2000 00:54:48 +0200, Martin Stahl <kra...@uplink.de> wrote: Quote>Frank Peelo wrote: Something tiny like that. Worked in 40-column CGA text mode. Displayed a maze in dark blue, with a sort of owl-like face representing you. You could shoot in any of 8 directions using 4 keys under your left hand, while your right hand worked 4 keys on the numeric keypad to move you around the place. Scattered around the maze were boxes out of which came blobs called "snipes" which would attempt to kill you. As with many games the plot is simple: if it moves, shoot it, if it doesn't move shoot it anyway. If you wipe out the snipes and the boxes out of which they come, then you win. In some skill levels your "bullets" bounce and you usually kill yourself; in other levels you die if you touch the walls of the maze, and so on. I never saw a copyright message displayed by the program, or any FP |
derek_as..
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesQuoteStudent, T.U.E. <YourN...@student.tue.nl> writes: An appropriate construction technique would depend on the "type" of maze you are trying to create. For mazes where there is one and only one path from any cell to any other cell, methods for the construction of a tree can be applied. For example, the program below creates a tree by making sure that every cell on row "n" has one and only one route to row "n+1". program maze; Sent via Deja.com http://www.deja.com/ |
Kenn
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesQuoteStudent, T.U.E. wrote in message <8cv155$ab...@news.tue.nl>... m:array[0..127,0..127] of byte; dx,dy:array[0..3] of integer; xl,yl:integer; procedure makemaze(x,y,d:integer); begin repeat d:=d and 3; nx:=(x+dx[d]) and 127; if m[nx,ny]=0 then inc(d); begin for xl:=0 to 127 do randomize; UNTESTED - ripped out of some old code. This procedure will make a maze of size 128*128. As it is it wraps around Kenn |
Mark Vaugh
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesYourN...@student.tue.nl (Student, T.U.E.) wrote in <8cv155$ab...@news.tue.nl>: Quote>Could anyone help me with a maze constructing algorithm?? -- Mark Vaughan Visit the Numerical Methods in Pascal web page at |
Martin Stah
![]() Delphi Developer |
Wed, 18 Jun 1902 08:00:00 GMT
Re:mazesQuoteFrank Peelo wrote: Quote> That'd be a maze alright. The program was, what, a 20K .COM file? you only see the way you walk, not your own face. You have to walk through a maze and collect yellow pieces. You can not shoot, but you have to beware of owl-like ghosts which want to kill you. The "3-demon" program is 55 kByte "big" .EXE file with a file to store the highscore. Quote> I never saw a copyright message displayed by the program, or any a 133 MHz Pentium and it worked in the same speed. (No rocket-propelled ghosts ;-) ) If you are interested in a copy, I can send you one. Because it is shareware there would be no licence problem. In 1983 you could order the complete pascal source code. Maybe the company still exist and one can have still the code. regards Martin |