I dont find any good blog posting describing the solution or may be i missed. Can any one help?
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Name |
---|
1. a1<a2.
2. a1-a2>1.
3. a1-a2=1, but the second player already won.
4. a1-a2=0, but the first player already won.
5. Both first and second player already won.
The check, if the player has won, is quite straightforward, we consider that he won, if some horizontal, vertical, or diagonal is filled completely by this player. So, if the state is not illegal, you perform this check for both players. If someone wins, we are done.
Finally, if nothing of the previous was true, check if a1+a2=9. In that case we have a draw. If a1-a2=0, it's the first player turn, and the second player turn otherwise.