Skip to main content

Coding general AI.

As promised I've spent most of my time this week
on coding basic gameplay.

[text above each agent displays debug info]
I started out having separate state machines for AI decision making and actions/animation.

Sometimes AI control calls for very rapid switches of states which would also disrupt the animations. Causing them to stutter or jump.


But by setting up Animations to only switch after a short delay I eliminated the problem you get with having AI and actions in the same state.

If a call to switch animation occurs, but rapidly switches back (like stopping for an instant when walking) the switch is ignored.

So I refactored them in to a single finite state system with inheritance helping to structure things like animation and path finding.


[Blocked in!]
AI is pretty basic. They just try to get towards you avoiding squares they've already visited. But it works surprisingly well.

It's easy to get blocked in by the enemy, but you can use the nature of the grid to avoid fighting too many enemies at once.

I don't know how well this system will work once I introduce the other party members. That's going to take some serious testing to see if it's fun or not.

[Big and small agents interact seamlessly]
 I added the ability to rotate the camera 90 degrees, this keeps the WASD movement system working well, but allows you to see behind things or get a better view.

Controls are going to be all keyboard based, with a radial menu handling things like item use, switching control of party members, resting, using special abilities etc...

There will probably be a shortcut bar too, so you can map some short cuts to the number keys.

[Water shader]

I did spend some time this week mucking about with shaders again, but there seems to be some kind of bug when rotating the camera. Sigh.


You know, it's funny that shader isn't in the spellchecker dictionary...

You can check out the video that goes with this entry HERE.

Comments

Popular posts from this blog

Upstairs / Downstairs.

I've decided to make my prefabs multilevel. Later this should allow me to add pit traps and other great stuff. It also makes it easier to line up stairs so that you can exit them on the same co-ordinates where you entered them. The prefab editor is pretty much finished, it just needs some code for loading up prefabs from a saved dictionary, so that they can be checked or edited. The entries will need to be forwards compatible, so I'll be loading each tile and then translating the indexes to a new array, that way if I add extra indexes or extra info (like traps or puzzles) I'll be able to update existing prefabs to work with the new standard. Click for a video.

Automating Level imports from Blender to Godot

  Recently I've been making some levels in Blender an importing them into Godot. There are only about 7 or 8 shaders for each level, not counting dynamic objects which will be added later. But to improve rendering performance, it can be a good idea to split the meshes up into sections. At that point you might be faced with a list like this: Or it might be even more chaotic, if you didn't use simple names for the objects in your level. So it can take a long time to sort out all the meshes, make them unique and add textures and so on. Blender imports with simple Blender textures, or with placeholder materials. This is sometimes OK, but if your Godot shaders are very different to those used by Blender, it means applying new materials to every mesh object in the level when you import the scene. I found that during the design process, I was importing and readying a level several times before I was happy with the final layout. So at first I was wasting a lot of time. In Blender, I us...

The basics of A Star Pathfinding

Someone wanted to know how the code works for basic A* path-finding. Rather than reply in Facebook, I've made a quick post for it here. 1. create an array of nodes to represent your level.  It can be nodes with connections, or it can be a list of co-ordinates where connections are assumed to be NESW where a node exists.   Example 1:   level = {"001":[["002", 5.0], ["003", 5.0]], "002":[["001", 5.0], ["003", 5.0]], "003":[["002", 5.0], ["001", 5.0]]}    This is a dictionary based "mesh" type array, for easy reading. You can see it has 3 nodes arranged in a triangle. Each node is connected to two others, and in this case, the distance between each is 5.0 units.    It's easy to see how this mesh could be expanded. You just need more points. Each point must include its two neighbors and the distance between them.   Example 2:   level = [[0,1,1,0], [0,0,1,1], [1,1,1,0], [1,0,0,0...