Hey all! How’ve you been?
I’ve been very busy lately. I know I don’t post often enough, but I’m working on changing that up. And, for starters, I’ve posted a brand new tutorial! Been a few years since I’ve done that, right?
Well, for you AI newbies, I’ve posted a tutorial for a Finite State Machine I made a few years ago, affectionately called the Super Simple State Machine. I even posted the code and a Unity package demo project up on my GitHub for you. Isn’t that nice?
Give the tutorial a look-see, let me know if you like what you see and you want more.
That sounded really dirty… Sorry about that. Later!
Link: Game Programming Patterns – The Observer
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!
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!
Update: Oct. 4th, 2018
Hey! So I stopped being so lazy, and actually wrote up a tutorial for A* Pathfinding that I call KMStar! Go ahead and check it out!
W00t! 2,000 views on the blog today! Probably most are spammers, but who cares? Still a victory!
Anyway, What I’m going to do is use this blog to not only rant about useless stuff I find interesting, but to also store code snippets and algorithms for later use in applications and such. And I guess I’ll share them too.
So, today, since it’s been a few years since College, I’m going to bone up on some of my math. I’m going to do a step-by-step of the LookAt Algorithm. Continue reading Math Magician – LookAt Algorithm