The solution is as follows::Fortunately the 2-d array structure need not be changed for this particular program. The error was when the board state was being generated the children were also generated via the constructor. This is bad because the children will also be stored as State Objects. As you can see since each one will call the child...

I suggest you look into this problem more, because go is one of the games that is still unsolved. Its branching complexity is greater than that of chess. Go-Moku however has been solved but with the use of the alpha-beta search tree. What you are overlooking is that the "AI" has to perform a brute force search on all possible moves that it can...

I am currently trying to program a Go-Moku game with AI implemented. This of course involves the alpha-beta algorithm. I am running into memory problems, and I believe it is because of the way I have been storing the "board" information. Initially I decided to use a 2-d array so that traversal and storage would be easy e.g. board[one][two] The...