Google Mail Calendar Documents Reader Web more »
Recently Visited Groups | Help | Sign in
Google Groups Home
Message from discussion 7DRL: Bob and Trev: Resurrection

View Parsed - Show only message text

Path: g2news1.google.com!postnews.google.com!8g2000cwh.googlegroups.com!not-for-mail
From: Phlamethro...@gmail.com
Newsgroups: rec.games.roguelike.development
Subject: Re: 7DRL: Bob and Trev: Resurrection
Date: 10 Mar 2007 10:32:09 -0800
Organization: http://groups.google.com
Lines: 27
Message-ID: <1173551528.903165.198460@8g2000cwh.googlegroups.com>
References: <1172021941.913013.186770@v33g2000cwv.googlegroups.com>
NNTP-Posting-Host: 91.84.11.161
Mime-Version: 1.0
Content-Type: text/plain; charset="iso-8859-1"
X-Trace: posting.google.com 1173551535 28760 127.0.0.1 (10 Mar 2007 18:32:15 GMT)
X-Complaints-To: groups-abuse@google.com
NNTP-Posting-Date: Sat, 10 Mar 2007 18:32:15 +0000 (UTC)
In-Reply-To: <1172021941.913013.186770@v33g2000cwv.googlegroups.com>
User-Agent: G2/1.0
X-HTTP-UserAgent: Mozilla/4.0 (compatible; MSIE 6.0; Windows NT 5.1; SV1; .NET CLR 1.1.4322; .NET CLR 2.0.50727),gzip(gfe),gzip(gfe)
Complaints-To: groups-abuse@google.com
Injection-Info: 8g2000cwh.googlegroups.com; posting-host=91.84.11.161;
   posting-account=bDRC7A0AAACF2inNsTKqE7bM4XnetBGT

Well, I suppose I might as well post a progress update, since I
started coding last night.

So far I've managed to write the core of the engine, including the
load/save system, prototype map generator, and line-of-sight code. I
can happily wander around the map opening and closing doors.

http://www.phlamethrower.co.uk/misc2/batr1.png

But then I tried running it under a BBC emulator, and discovered how
hideously slow it all is. Some of it seems unavoidable (20 seconds to
load the 4KB data file with all the dungeon items in), other bits are
due to the unoptimised state of the code (taking 1 second to draw each
map cell), and other bits suggest I'm pushing the machine too hard -
the line of sight algorithm takes around a minute to run!

Admittedly I am only using a very simple ray casting algorithm (mainly
to keep code size down - it's already up to 10KB, out of 16KB max I
have available when taking all the other data into account), but even
if I were to take the time to implement a beam casting or similar
algorithm I doubt it would approach a playable speed. So currently I'm
trying to decide whether I should switch to a different LOS technique
(e.g. a room gains visibility when you enter it, but remains visible
even if you go elsewhere), or ignore the speed problem and have a go
at crafting some assembler optimisations once the competition is
over :)


Create a group - Google Groups - Google Home - Terms of Service - Privacy Policy
©2009 Google