cdo/minesweeper-bot
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Guess and update in a loop

Browse Source
This commit is contained in:
Camden Dixie O'Brien 2025-03-06 21:54:21 +00:00
parent eeea09eaa2
commit e36c1c6502
1 changed files with 22 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
main.c
View File

@ -5,6 +5,7 @@
#include "puzz.h" #include "puzz.h"
#include <stdbool.h>
#include <stdint.h> #include <stdint.h>
#include <stdio.h> #include <stdio.h>
#include <stdlib.h> #include <stdlib.h>
@ -40,23 +41,36 @@ int main(void)
puzz_t field; puzz_t field;
memset(field, UNKNOWN, sizeof(field)); memset(field, UNKNOWN, sizeof(field));
int x = rand() % WIDTH; bool solved = false;
int y = rand() % HEIGHT; do {
if (probe(x, y, field) == DEAD) { int x = rand() % WIDTH;
field[x][y] = KILLER; int y = rand() % HEIGHT;
fprintf(stderr, "Dead\n");
} else { if (probe(x, y, field) == DEAD) {
field[x][y] = KILLER;
break;
}
for (y = 0; y < HEIGHT; ++y) { for (y = 0; y < HEIGHT; ++y) {
for (x = 0; x < WIDTH; ++x) { for (x = 0; x < WIDTH; ++x) {
if (field[x][y] == UNKNOWN || field[x][y] == MINE) if (field[x][y] == UNKNOWN || field[x][y] == MINE)
continue; continue;
const int mines = countadj(field, x, y, MINE); const int mines = countadj(field, x, y, MINE);
const int unknowns = countadj(field, x, y, UNKNOWN); const int unknowns = countadj(field, x, y, UNKNOWN);
if (mines + unknowns == field[x][y])
if (unknowns > 0 && mines + unknowns == field[x][y])
setadj(field, x, y, UNKNOWN, MINE); setadj(field, x, y, UNKNOWN, MINE);
} }
} }
}
solved = true;
for (y = 0; y < HEIGHT; ++y) {
for (x = 0; x < WIDTH; ++x)
solved &= field[x][y] != UNKNOWN;
}
} while (!solved);
puts(solved ? "Solved" : "Dead");
putchar('\n'); putchar('\n');
for (int y = 0; y < HEIGHT; ++y) { for (int y = 0; y < HEIGHT; ++y) {