Skip to main content
Computer Science

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

3
  • 1
    $\begingroup$ @Evil 1) This is just an example to convey my point and not some real game with a single player. 2) The point is the infinite repetition of moves whether pruning takes place or not. 3) The square (1, 1) is not a goal, consider it to be the best option amongs the 3 available squares with the evaluation vaue of +100. $\endgroup$ Commented Oct 18, 2019 at 2:56
  • $\begingroup$ Please describe you real problem instead of a simplified one that doesn't make sense with using min-max. Your current algorithm, according to your description, tries to find the best possible solution for a double move and seems to yield correct results. $\endgroup$ Commented Oct 18, 2019 at 3:14
  • $\begingroup$ @siracusa I have edited the question with a simplified chess example. Please have a look. $\endgroup$ Commented Oct 18, 2019 at 5:32