Home>
I want to perform search evaluation of board games without using recursive expressions

Content of the question
In order to perform search evaluation of board games such as tic-tac-toe without using recursive expressions, we made a prototype to find a place to put it for the number of readers and evaluate that place, but there was a problem that flag management became complicated. I did.
What kind of algorithm, data structure, and coping method are required to perform search evaluation of a board game without using recursive representation?

Flag management becomes complicated
I don't know how to express instead of recursion

What I tried

〇 Find a place to put it for the number of readers and evaluate the place
〇 Considering the use of Deque and stack classes
〇Verify the operation of tic-tac-toe written in recursion

  • Answer # 1

    We will work on problem solving by referring to books on data structures and algorithms and search methods that have advised us.
    Thank you very much.