LD 17. Are you entering? Post your stuff here

[JSoftware]

Here's some documentation of my "progress". It's not playable yet, and I don't really know precisely where it'll go from here. But well, I think it might be possible to get it playable. Maybe even fun!

[paul_nicholls]

neat! Love the programmer's art

Well, as I said earlier I am very busy, but I will see if I can get something going for the compo anyway LOL

http://www.ludumdare.com/compo/2010/...-ludum-dare-4/

cheers,
Paul

[Brainer]

NEVER use randomize more than once in a proc/func. Now that I know doing so produces very odd behavior... on to a more lively island! [[ As a side effect, it takes approximately 10x less time to generate a map now ]]

Why don't you use something else instead? Here's a unit I once found when I was looking for a better random number generator:
[code=delphi]
{$R-} { range checking off }
{$Q-} { overflow checking off }
{ ----------------------------------------------------------------------
Mersenne Twister: A 623-Dimensionally Equidistributed Uniform
Pseudo-Random Number Generator.

What is Mersenne Twister?
Mersenne Twister(MT) is a pseudorandom number generator developped by
Makoto Matsumoto and Takuji Nishimura (alphabetical order) during
1996-1997. MT has the following merits:
It is designed with consideration on the flaws of various existing
generators.
Far longer period and far higher order of equidistribution than any
other implemented generators. (It is proved that the period is 2^19937-1,
and 623-dimensional equidistribution property is assured.)
Fast generation. (Although it depends on the system, it is reported that
MT is sometimes faster than the standard ANSI-C library in a system
with pipeline and cache memory.)
Efficient use of the memory. (The implemented C-code mt19937.c
consumes only 624 words of working area.)

home page
http://www.math.keio.ac.jp/~matumoto/emt.html
original c source
http://www.math.keio.ac.jp/~nisimura...t/mt19937int.c

Coded by Takuji Nishimura, considering the suggestions by
Topher Cooper and Marc Rieffel in July-Aug. 1997.

This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Library General Public
License as published by the Free Software Foundation; either
version 2 of the License, or (at your option) any later
version.
This library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
See the GNU Library General Public License for more details.
You should have received a copy of the GNU Library General
Public License along with this library; if not, write to the
Free Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
02111-1307 USA

Copyright (C) 1997, 1999 Makoto Matsumoto and Takuji Nishimura.
When you use this, send an email to: matumoto@math.keio.ac.jp
with an appropriate reference to your work.

REFERENCE
M. Matsumoto and T. Nishimura,
"Mersenne Twister: A 623-Dimensionally Equidistributed Uniform
Pseudo-Random Number Generator",
ACM Transactions on Modeling and Computer Simulation,
Vol. 8, No. 1, January 1998, pp 3--30.


Translated to OP and Delphi interface added by Roman Krejci (6.12.1999)

http://www.rksolution.cz/delphi/tips.htm

Revised 21.6.2000: Bug in the function RandInt_MT19937 fixed
---------------------------------------------------------------------- }

unit UMersenneTwister;

interface

{ Period parameter }
const
MT19937N = 624;

type
tMT19937StateArray = array [0 .. MT19937N - 1] of longint;
// the array for the state vector

procedure sgenrand_MT19937(seed: longint); // Initialization by seed
procedure RandomizeMT(); // randomization
function RandomMT(Range: longint): longint;
// integer RANDOM with positive range
function genrand_MT19937(): longint; // random longint (full range);

const
MT19937M = 397;
MT19937MATRIX_A = $9908B0DF; // constant vector a
MT19937UPPER_MASK = $80000000; // most significant w-r bits
MT19937LOWER_MASK = $7FFFFFFF; // least significant r bits

{ Tempering parameters }
TEMPERING_MASK_B = $9D2C5680;
TEMPERING_MASK_C = $EFC60000;

var
mt: tMT19937StateArray;
mti: integer = MT19937N + 1; // mti=MT19937N+1 means mt[] is not initialized

implementation

{ Initializing the array with a seed }
procedure sgenrand_MT19937(seed: longint);
var
i: integer;
begin
for i := 0 to MT19937N - 1 do
begin
mt[i] := seed and $FFFF0000;
seed := 69069 * seed + 1;
mt[i] := mt[i] or ((seed and $FFFF0000) shr 16);
seed := 69069 * seed + 1;
end;
mti := MT19937N;
end;

function genrand_MT19937: longint;
const
mag01: array [0 .. 1] of longint = (0, MT19937MATRIX_A);
var
y: longint;
kk: integer;
begin
if mti >= MT19937N { generate MT19937N longints at one time }
then
begin
if mti = (MT19937N + 1) then // if sgenrand_MT19937() has not been called,
sgenrand_MT19937(4357); // default initial seed is used
for kk := 0 to MT19937N - MT19937M - 1 do
begin
y := (mt[kk] and MT19937UPPER_MASK) or (mt[kk + 1] and MT19937LOWER_MASK);
mt[kk] := mt[kk + MT19937M] xor (y shr 1) xor mag01[y and $00000001];
end;
for kk := MT19937N - MT19937M to MT19937N - 2 do
begin
y := (mt[kk] and MT19937UPPER_MASK) or (mt[kk + 1] and MT19937LOWER_MASK);
mt[kk] := mt[kk + (MT19937M - MT19937N)] xor (y shr 1)
xor mag01[y and $00000001];
end;
y := (mt[MT19937N - 1] and MT19937UPPER_MASK) or
(mt[0] and MT19937LOWER_MASK);
mt[MT19937N - 1] := mt[MT19937M - 1] xor (y shr 1)
xor mag01[y and $00000001];
mti := 0;
end;
y := mt[mti];
inc(mti);
y := y xor (y shr 11);
y := y xor (y shl 7) and TEMPERING_MASK_B;
y := y xor (y shl 15) and TEMPERING_MASK_C;
y := y xor (y shr 1;
Result := y;
end;

procedure RandomizeMT();
var
OldRandSeed: longint;
begin
OldRandSeed := System.randseed; // save system RandSeed value
System.randomize; // randseed value based on system time is generated
sgenrand_MT19937(System.randseed); // initialize generator state array
System.randseed := OldRandSeed; // restore system RandSeed
end;

function RandomMT(Range: longint): longint;
asm
PUSH EAX
CALL genrand_MT19937
POP EDX
MUL EDX
MOV EAX,EDX
end;

end.
[/code]

[chronozphere]

Wow... all looking great! I especially like Dazappa's pics of his hexagon based Island. It reminds me of settlers of catan (Board game I like to play. )



Looking forward to playing these finished games. You've got 16 hours and 56 minutes left.

This makes me pretty excited. Would like to join the next LD compo, if time allows it.

[Traveler]

Nice work so far guys!

Here's mine. I doubt its going to win a price for best graphics but, the way it's going I'm already happy when I get all gameplay in there.

[Traveler]

A small update. There are now people waiting and all things in the water produce a small wake

[WILL]

Very cool. You've got talent Alex. You should make games more.

BTW I own and LOVE Catan. Actually most of my current game projects are inspired directly by board game style play. ('Treasure Hunters: The Dark Labyrinth' and 'A Hero's Adventures')

[chronozphere]

Awesome. You guys are almost there. 6 hours and 41 minutes to go.

[dazappa]

The next screenshot you guys will see will be of my completed* game. Bit time consuming to make pretty pictures. As a sidenote, this is also why during LD I never release demos :: it takes way too much time to try to package everything up, and I figure 90% of the bugs in the final version will be ones I know of (because I test obsessively).

Wish me luck! I still have a lot left on my todo list.


* It's not going to be the absolute final version, because I really want to patch it up some more after the competition.

[Traveler]

Thanks guys

I'm afraid I wont make it though. There are too many things still to do and next to the available time, my knowledge of PyroGine is still quite limited. But, I'm satisfied with the work done considering I installed PyroGine only yesterday. And most of what you see here is just from today alone.
Jarrod has been a big help and from what I have seen so far, his engine is quite powerful. I definitely think more people should look into it.