Tic-Tac-Toe-Tomek solutions
Tic-Tac-Toe-Tomek was solved using OCaml by 40 contestants. Solution sizes: average 2203 bytes (shortest: 1119; longest: 4584).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Tic-Tac-Toe-Tomek was solved using OCaml by 40 contestants. Solution sizes: average 2203 bytes (shortest: 1119; longest: 4584).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |