I know I don’t post very often – believe me, 2015 and 2016 have been a helluva ride – but I have been writing a lot of code. I mean, a lot. A lot of the code I write, since it’s Unity, I have compartmentalized in scripts that I import over to a multitude of projects. Seeing as how a lot of these are used and fleshed out in projects that will never see the light of day, I thought “Hey, why not just put them up on the site?”
So, I’ve created a Github account, and I’m placing them in their own GitHubGists (or Repositories, if they span multiple files). This would be a quick, dirty, and effective way to get my code out to you guys so maybe, just maybe, it can actually be used in a project somewhere.
Any code I put up in my Gist, I’ll also link to it somewhere on this site as well for direct linkage.
OK, first off: No, I’m not dead. 2: No, I’m not a zombie. 3: Yes, zombies are considered dead. 4: I’d like to take a moment to consider a pivotal part of any game programmer’s arsenal of design patterns: The Observer.
The observer pattern, to put it simply, is an object that will only perform a specific action when another object/objects (called “the subject”) are in a particular state. A gentleman by the name of Bob Nystrom is working on an online (and soon physical) book regarding game programming, called GameProgrammingPatterns.com. In his book, he describes the fundamentals and design of the Observer pattern in a fun and simple way that can have even the most basic programmer up-and-running with Observers in no time; like a strange digital voyeur of code.
OK. That was disturbing.
Anywho, go run over to his site, and check out the other “chapters” he’s done. His book is still a WIP, but it’s already a classic. Take care!
The other day, I found a post in Reddit’s /r/Unity3D to random procedural Zelda-style map generation using a binary-tree by a dude named David León, a game programmer. He goes on to explain his method for generating the maps, and even has downloads to his source code. He also has a bunch of other tutorials for creating a rougelike-style maps and so-on. Really great stuff, and if you’re looking for a little inspiration for random map generation, check out David León’s tumblr.
You wanna know what always used to break my brain back in school? Two’s complement. For those of you unversed in nerd geek, i’s the computer’s way of interpreting negative and positive binary numbers by using the left-most bit as the sign.
Lets talk in nybbles here (4 bits instead of 8). In a perfect unsigned world, the number 15 is expressed as 1111 in binary. However, speaking in signs, this is -1.
OK, so a while back I posted a link for a simple implementation for A* Pathfinding for C/C++. The page gets a bunch of hits, but I get a lot of people asking me to explain it. Well, it’s not my code to really explain, and I haven’t tested it out for myself. Rather than go through and make a huge tutorial, I figured I’d take the lazy route, and provide you with a resource to help explain it a bit. This page breaks down A*Pathfinding to the basics and gives a great explanation down to even the heuristics (If you don’t know that word, you’ll need this link).
So, now with this in hand, pathfinding should be easier to grasp now. Give it another go, and let me know how it turns out! Good luck!
Seeing how this is one of the more popular posts on my blog, I wanted to update the link for the algorithm. The above link works, but the creator has moved all his “recipes” to his GitHub. Here’s a link for his C++ A* Algorithm Recipe. Good luck!
You know what irks me? Going online to look up something simple, like Dot Product or Cross Product, and getting nailed in the face with calculus proofs and discrete mathematics on why this and that happens, but never getting a simplified answer on what I’m looking up!