Restricting movement based on tiles moved

xyz

xRegnarokx I don't think your code actually builds a tree. You never call MoveTree::append() so no connectivity between nodes is ever established. I highly recommend you make a generalized tree/node class outside of Godot, so you can concentrate solely on the data structure and not be tempted to quickly shoehorn it into context of your game, before understanding it. That's why I suggested Python. You need to be able to think about data structures in completely abstract way.

xRegnarokx

xyz Yeah, I wasn't building this for the context of my game, it was just to generate a random tree. However, I did realize that error where I was appending them to the stack, but never actually attaching them to the MoveTree class. That was an oversight on my part.

I have also been focusing on the data structure, though just using Godot. I used my research on Python data structures as the basis.

I did eventually change it to have this.

current.append(MoveTree.new(current.number + 1)
stack.append(current.left_child)

I did this for both the left and right child as well as the center child. In order to actually connect the children to the previous node and thus create the hierarchy.

Is there a reason you recommend python to do this in other than just trying to remove my thinking from the practical application to my specific game context? Also, there are multiple types of trees, would you recommend I build each type of tree, or do you think understanding and being able to build one type generally equates to being able to build other types?

Thank you again for all your help, and direction, I really do appreciate and it has helped my understanding grow immensely.

xyz

xRegnarokx I recommended Python because it's similar to GDScript but with it you run programs in a simple traditional fashion from the command line interface. You give them some input data, they run once and produce some output. I think that's the optimal environment when learning core programming stuff. GDScript itself is great as a learning language but the engine environment in which it runs can be distracting and sometimes confusing when you need to focus on "boring" fundamental stuff.

As for tree types, yes there are numerous types but they are all special cases of the same thing. Best to implement the most general kind that stores a reference to some per-node data and can have any number of child nodes, from none to infinite.

Once you have the code that can make such a tree, you should add a print function that prints out the whole tree, perhaps in a form similar to Godot's scene tree. After that you can make a generator that builds randomized trees with specified number of nodes, and a search function that traverses the tree and searches for given node data.

Making all this work properly should get you a solid foundation for using trees with various algorithms.

xRegnarokx

xyz Okay, I'll use Python to practice tree building with those three objectives.

Definitely the search function will be important, otherwise the tree won't do me much good.

« Previous Page