query: Tic Tac Toe heuristic AI
positive_passages.docid: 151942
positive_passages.text: What algorithm for a tic-tac-toe game can I use to determine the "best move" for the AI?
negative_passages.docid: 44620
negative_passages.text: Reference for combinatorial game theory.
negative_passages.docid: 19936
negative_passages.text: Coin Tossing Game Optimal Strategy
negative_passages.docid: 121575
negative_passages.text: Meet-in-the-middle with checking complexity
negative_passages.docid: 158163
negative_passages.text: Lights out game algorithm
negative_passages.docid: 138
negative_passages.text: Maximizing expected value of coin reveal game
negative_passages.docid: 94703
negative_passages.text: Time complexity and optimality
negative_passages.docid: 121605
negative_passages.text: A coin tossing game which leads to a contradiction
negative_passages.docid: 8049
negative_passages.text: Generating Combinations
negative_passages.docid: 146031
negative_passages.text: finding the optimal strategy
negative_passages.docid: 145304
negative_passages.text: Path finding in grid for objects that occupy more than one tile
negative_passages.docid: 86019
negative_passages.text: Game Theory: What are Best Strategies for High-Low game (game details are below)?
negative_passages.docid: 38680
negative_passages.text: Why do we use expectation in reinforcement learning?
negative_passages.docid: 13583
negative_passages.text: Preventing cheating for on-line arcade high score board
negative_passages.docid: 128147
negative_passages.text: Time Complexity of Ternary Search Algorithm
negative_passages.docid: 56996
negative_passages.text: Bouncing ball simulation computer science
negative_passages.docid: 125105
negative_passages.text: Roulette Selection in Genetic Algorithms