4 ms·
side note: Tic-Tac-Toe you can reasonably just brute-force all possible games to check if something plays perfect or not.
by detaro 5y ago
side note: Tic-Tac-Toe you can reasonably just brute-force all possible games to check if something plays perfect or not.
- bade 5y agoI know, the point was to exercise the various PyFL features.
- deleted 5y ago[deleted]
- armanboyaci 5y agoActually, the first moves of the players determines the result. And because of the symetries there are just 12 first moves. My tweets about this topic: https://twitter.com/arman_boyaci/status/1442436923960827913?t=4UMEPJNdMct0EQ8r2gFULg&s=19 https://twitter.com/arman_boyaci/status/1442436923960827913?...
- bade 5y agoYou sound like an expert. Are my heuristics unbeatable?
- armanboyaci 5y agoFor example, when X plays a corner, there is a possibility that your heuristic may play another corner right? In that situation X wins.
- detaro 5y agoif you assume perfect play. Which you can't if you try to confirm your implementation plays perfectly.