would it not also be a cat's game(no win con) before all tiles has been filled?
eg: [[1, 2, 2], [2, 1, 1], [0, 0, 2]]

PHP sample tests arguments are reversed, and there are no random tests.

In my opinion this cata not contain enough tests (I go it on Python), it's too easy to hardcode and pass it. For example there have place lack of tests for 'O', i make very simple one check for 'O' in row, and successful pass it. It's not check on columns or diagonal for 'O', or diagonal from right to left for 'X'

There are no tests in Python for antidiagonal(counterdiagonal) - board[0][2] - board[1][1] - board[2][0]

There is no vertical check for X or O, but it was a good challenge.

Javascript node v8 needs to be updated to v18. Absolutely no test cases

C:

• assertion messages are unehlpful
• memory model of returned pointer is not explained
• initial code crashes

This kata is a subject to deduplication process here: https://github.com/codewars/content-issues/issues/203.
Please join the discussion to help us identify duplicate kata and retire them.

PHP Translation

(this took me time to implement the tests)

There are several ways to bypass the challenge of this kata. See my latter two solutions. Suggest these be patched up.

The scoring done by the kata is insane: in what world does a draw count as a loss?

Similarly, I've never heard of a tiebreak system where after H2H the criteria goes back to the state before the tiebreak, which is the case with the current kata with the score differential.