Minesweeper Master solutions
Minesweeper Master was solved using OCaml by 20 contestants. Solution sizes: average 3432 bytes (shortest: 1478; longest: 6544).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
Minesweeper Master was solved using OCaml by 20 contestants. Solution sizes: average 3432 bytes (shortest: 1478; longest: 6544).
The list below is sorted by solution size. You can also sort by ranking.
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() |