fxm wrote:The most important is not the final result obtained, but rather all the paths taken to get there.

upvote

tip: the unit you control does not (seem to) fire

Lachie, could you put links to everything in the first post?

next on my practice list :-)

unit list idea. most-used at front

possible formula
access count in last 30 sec / (unit_time - unit_time_previous)

- load time

+ music
+ overhead parallax
+ RTS

can't wait to learn the game :)

404 on game by Pitto

fyi

thank you UEZ. you are a talented programmer.

i use this to debug my raster-based renderers var w = 640 var h = 480 screenres w,h,32 var a = 3.14159/4 ' start angle while inkey="" var wm = w - 1, wh = wm/2 'dependents var hm = h - 1, hh = hm/2 #define show(x,y) line ( (x), (y) ) - ( (x)+r*cos(a), (y)+r*sin(a) ), -1 var r = sqr(w*w+h*h...

i nominate srvaldez, ST_W

when I developed 'ytQSort2' it took me at least 2 days to get it working. quicksort, it would seem, is one of my achilles' heels. D. J. Peters when I run your pointer sort (latest WinFBE which uncludes fbc 1.06) it still shows Munair's version faster. Have you tried your sort with my profiler? dim s...

updated with Munair's quicksort

cool to finally see a mergesort here

nice! with the help of a video by inigo quilez "iq", and my own skills, i made an optimized sphere hit. but to use it, you'll need normalize declare property norm as d3d '' or change to function .. property d3d.norm() as d3d var s = 1 / sqr( x * x + y * y + z * z ) return d3d( s * x , s * ...

the range thing. with a 64 bit state i guess the bias is ike a needle in a haystack. for a speedy range, you've found a highly unexpected (since mod relates with division) optimization [update] haven't debugged yet with yours (have 2 tests running) Dim Shared As Ulongint x = 12, w = 0 Dim As String ...