Hacker News Reader

side note: Tic-Tac-Toe you can reasonably just brute-force all possible games to check if something plays perfect or not.

Actually, the first moves of the players determines the result. And because of the symetries there are just 12 first moves.

You sound like an expert. Are my heuristics unbeatable?

For example, when X plays a corner, there is a possibility that your heuristic may play another corner right? In that situation X wins.

if you assume perfect play. Which you can't if you try to confirm your implementation plays perfectly.

I know, the point was to exercise the various PyFL features.