# All Possible Ties in Tic-Tac-Toe

[tag:code-golf] [tag:tic-tac-toe] [tag:kolmogorov-complexity]

Your task is to output all possible ways to end a game with a tie (all rows, columns, and diagonals are completely filled and do not have 3 X's or 3 O's) in [Tic-Tac-Toe](https://en.wikipedia.org/wiki/Tic-tac-toe) (assuming X goes first):

```
OXO  XXO  XOX  OXX
XOX  OOX  XOX  XOO
XOX  XXO  OXO  OXX

XOX  XOX  OXX  XXO
OOX  XOO  XOO  OOX
XXO  OXX  XOX  XOX

XOX  OXX  OXO  XOO
XXO  XXO  OXX  OXX
OXO  OOX  XOX  XXO

OXO  XXO  XOX  OOX
XXO  OXX  OXX  XXO
XOX  XOO  OXO  OXX
```

(It does not need to be arranged in the above way.)

## Rules

- Output can be in any convenient format.
- You may use different characters to represent X and O as long as they are distinct.
- [Standard loopholes](https://codegolf.meta.stackexchange.com/q/1061) are forbidden.
- This is [tag:code-golf], so the shortest code in bytes wins.