Nsryjdtyk

Pardon me if a similar question was asked before, I've tried hard searching for an answer but to no avail.

So, I was making a Tic-Tac-Toe Monte Carlo Tree Search algorithm. The Node struct required to have a list because incomplete types cannot be used inside a struct. But, I faced a major problem when setting the parent of a newly created Child Node.

What I did is that I first created a ChildNode, set the CurrentNode as its Parent Node and then did some things with the Child Node. Then I pushed back the memory address of the Child Node to the list containing pointers to the child nodes of the Current Node. The problem is, every time the ChildNode is modified (to add more different Child Nodes) even after its reference is pushed back into the list, the value pointed to inside the list changes as well. Which causes problems in my code.

The code below is not the actual code, but it is made to reflect what my problem actually is.

Tree tree;

Node* CurrentNode = &(tree.root);

Node ChildNode;



for(int i = 0; i < 6; i++)

{

    ChildNode.parent = CurrentNode;

    //do things to Child Node

    CurrentNode->childs.push_back(&ChildNode);

    CurrentNode = CurrentNode->childs.back();

}

I hope it can be solved easily without hassle.