Skip to main content

Project Tethys Post-mortem

Project Tethys was my entry for Ludum Dare 29. Here's the elevator pitch:
Project Tethys is a fast-paced underwater 2D shoot-em up inspired by the likes of Defender and Resogun. You control an advanced combat submarine tasked with defending an underwater research facility against an invading army. If you enjoy classic arcade-style action, this game is for you!
So far the game has been getting pretty good feedback. It's the most polished entry I've ever submitted for a Ludum Dare and the one that I'm most proud of so far. Here's what it looks like in action:


I've carried on working on it since the end of the competition, fixing some of the problems people have commented on and adding more of the features I'd originally planned. Expect another post about that when I'm ready to release it.

Tools

  • Unity 4.3 (free version)
  • GarageBand for iPad
  • bxfr
  • Nuke 8.0 (specifically the ModelBuilder node)
  • Paint.NET
  • VLC

What went right

  • Making a game I wanted to play! Helped me stay motivated and to be more critical when testing it, leading to a better game overall.
  • Using Unity. This was my first time using Unity and it was awesome! So much quicker than the hand-rolled javascript framework I'd been using for my previous LD entries. It allowed me to concentrate on the game rather than the tech.
  • Choosing a look that I could handle. The art style & setting only needed simple 3D models with no animation or rigging, which are things I suck at so I was glad to avoid them. Dynamic lighting makes it all look good anyway.
  • Time management. I had something playable by the end of the first day & spent the second day adding content and polishing it. At the end of the second day I stopped working on gameplay elements and started adding the bits around the game (titles, help, high scores, etc.).
  • Music. GarageBand on the iPad is an awesome way to quickly create music for game jams. Also, I've played around with it before so at least had some idea what I was doing.

What went wrong

  • Familiarity with Unity. Because it was my first Unity project I had to spend a fair bit of time watching tutorials and reading docs during the competition. If I already knew all that stuff I'd probably have had time fit in more of the enemy and power-up types I'd planned.
  • The explosions. That was a noob error: I should have ticked the box in Unity to make them 3D sounds, so that the ones further away weren't as loud. Oh well.
  • No radar or minimap. The game really needs one: without it you can't tell where the enemies are approaching from or where the power-ups are falling. I kept putting off doing this during the competition (because I wasn't sure how to do it), but I should have listened to myself.

Lessons

  • Make a game that you want to play. It's a lot easier going if you do.
  • Keep using Unity!
  • Learn your tools ahead of time, so that you don't waste time learning them during the competition (and don't make noob errors).
  • Day 1 is for gameplay, day 2 is for content & gameplay refinement, the final few hours are for polish and completeness.

Comments

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...

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 ...

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!