I started decades ago with the old GW-BASIC. Eventually I upgraded to QB. I didn't participate in the community back then though. Eventually I started dabbling in C and Fortran, but found my way back to freebasic about five years ago.

Nice! Cute little game. I got to to about the 5th level.

I've been lurking a bit and reading this thread; can't wait to see how this turns out.

The translator Firefox addon I use translates "bit" to "un poco", which I think is hilarious.

I can't reproduce the runtime error but I think I fixed the bug, which was in the mm function. Try it now.

Did at least the stuff with CURR and NXT make sense?

Here's my version. It should show what I mean #define SIZE 160 #define PIX 4 #define NXT (1-CURR) #define WHITE rgb(255,255,255) #define FRAMERATE 1./25 declare sub draw_world( world() as uinteger, CURR as uinteger) declare sub iterate_world( world() as uinteger, CURR as uinteger) declare function m...

You can cut the running time down by not copying from one array to another. Just have a single array of dimensions WIDTH x HEIGHT x 2. One of the two layers contains the current generation that you're reading from and the other contains the next generation that you're writing to. Then at the end you...

Yes, I did all that. All these things are at their latest versions, but I am still getting the same error.

I have tried all of these fixes and I still get "fbc: /lib/libtinfo.so.5: version `NCURSES_TINFO_5.0.19991023' not found (required by fbc)" no matter what I do.

Is there an ETA for a fix for this bug?

I'm trying and failing to make a game with FreeBASIC and OpenGL.

Yes. This shows clearly what's going on:
Now try putting 256 in a ubyte.

Here's my derp moment of the day dim as ubyte i for i = 0 to 255 do_something_with( i ) lots_of_lines_of_complex_code( i ) tedious_blather( i ) next i Scratching my head why this loop ran forever. Was something in my many dozens of lines of complex code causing i to be changed from within the loop s...

The last thing we need is a wrapper routine for all of this stuff that you can call from your main game loop. First reset colpak with suitable values: sub reset_colpak( byref colpak as collision_packet, byval player_position as point3d, byval player_velocity as point3d,_ byval player_angle as angles...

Just as we used the arguments in lowest_positive_root to keep track of the first collision among a single triangle's vertices and edges, we will use the colpak structure to store the information about the earliest collision among all the triangles tested so far. That goes into colpak.coll.epoint and...

Finally we can put all this together to test for a collision with a single given triangle. Here it is. Most of it will be explained in the many comments I have put in there. sub check_triangle( tri() as point3d, colpak as collision_packet ptr ) 'only two arguments; most of what we need is in colpak ...