Skip to main content

Ludum Dare 29: Beneath the Surface

I'm halfway through making a game for Ludum Dare 29. The theme this time around is "Beneath the Surface". For once I've had an idea right from the start that's practical, fun and in keeping with the theme. It's a lovely change from my usual pattern of starting with an idea that turns out to be impractical or boring & having to start over halfway through the competition. So on that basis alone I have high hopes for this one.

Here it is: Project Tethys

It's an underwater shoot-and-rescue-em-up inspired by the likes of Defender and Resogun. You control a state-of-the-art combat submarine tasked with defending an underwater research facility from an invading army. Or at least, that's what it should be if I can finish it in time...

The controls are arrow keys or WASD to move, left mouse button to fire.

There's still loads left to do: implementing the rescue mechanic; sound effects; enemy AI; a high score table; a menu system; better models and textures; a tutorial; and lots of polishing. Here's hoping I can get it all done!

One thing that's different this time around is that I've been using Unity instead of my own Javascript framework. This is my first time doing anything serious with Unity & it's been absolutely brilliant! It's such a productive environment. The documentation is absolutely first rate and the tutorials are some of the best I've ever encountered. If anyone on the Unity team is reading this: thank you!

Comments

Post a Comment

Popular posts from this blog

How to outperform std::vector in 1 easy step

Everyone who's familiar with C++ knows that you should avoid resizing a std::vector inside a loop wherever possible. The reasoning's pretty obvious: the memory allocated for the vector doubles in size each time it fills up and that doubling is a costly operation. Have you ever wondered why it's so costly though? It's tempting to assume that because implementations of the STL have been around for so long that they must be pretty efficient. It turns out that's a bad assumption because the problem, in this case, is the standard itself: specifically, the allocator interface. The allocator interface provides two methods that obtain and release memory: allocate allocates uninitialized storage (public member function) deallocate deallocates storage (public member function) (taken from this page ). What's missing is a   way of growing an existing memory allocation in place. In C this is provided by the realloc function, but there's no equiva...
2 comments
Read more

Triangle bounding boxes in a single byte

Just thought of a way to store the bounding box for a single triangle in only one byte. It's not really practical or something you'd ever really want to use, but what the hell. Assume we have some kind of indexed mesh structure with a list of vertex positions and a list of triangle indices:   struct Mesh {     std::vector<vec3> verts;     std::vector<uvec3> triangles;   }; We can find the bounding box of a triangle by taking the min and max of all three vertices:   vec3 Mesh::lowerBound(uint32_t tri) const {     vec3 v0 = verts[triangles[tri].x];     vec3 v1 = verts[triangles[tri].y];     vec3 v2 = verts[triangles[tri].z];     return min(min(v0, v1), v2);   }   vec3 Mesh::upperBound(uint32_t tri) const {     vec3 v0 = verts[triangles[tri].x];     vec3 v1 = verts[triangles[tri].y];     vec3 v2 = verts[triangles[tri].z];     return ...
2 comments
Read more

Solar Sailor: semi-playable

More progress! Solar Sailor is now kinda- sorta- playable. You can't win or lose yet, but it does have all this goodness: There are gates that you have to pass through. There's a direction line showing you which gate you have to pass through next. The NPC racers now have some basic AI and will actually try to fly through the gates instead of just drifting serenely and hoping for the best. You can try it out yourself here! If you can't be bothered to try it out, this is what it's looking like now: If you do try it, I'd really appreciate any feedback - especially bug reports!
2 comments
Read more