wordle-algorithm/solvedle.c

204 lines
5.0 KiB
C
Raw Normal View History

2022-09-03 13:58:20 -04:00
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <stdint.h>
2022-09-03 15:23:40 -04:00
#if TIME_SECTIONS
#include <time.h>
clock_t start, end;
double section_time, total_time;
char * curr_section;
#define START_TIME(section_name) do {\
curr_section = section_name;\
printf("BEGIN %s\n", curr_section);\
start = clock();\
} while (0);
#define END_TIME do {\
end = clock();\
section_time = ((double) (end - start)) / CLOCKS_PER_SEC;\
printf("END %s: %fs\n\n", curr_section, section_time);\
total_time += section_time;\
} while (0);
#else
// TIME_SECTIONS not specified, define to be nothing
#define START_TIME(section_name) 0;
#define END_TIME 0;
#endif
2022-09-03 13:58:20 -04:00
#define WORDS 12971
#define WORDLEN 5
#define CHARMASK ~(0b11u << 5u)
2022-09-03 15:23:40 -04:00
typedef struct signature {
2022-09-03 13:58:20 -04:00
char * word;
uint32_t sign;
} signature;
2022-09-03 15:23:40 -04:00
2022-09-03 13:58:20 -04:00
uint32_t
rawWC = 0,
fiveUniqWC = 0,
cookedWC = 0
;
int compare(const void * a, const void * b) {
2022-09-03 15:23:40 -04:00
return ((signature *)a)->sign - ((signature *)b)->sign;
2022-09-03 13:58:20 -04:00
}
2022-09-03 15:23:40 -04:00
signature* rmdups(signature * arr) {
2022-09-03 13:58:20 -04:00
// list is already sorted
uint32_t nitems = fiveUniqWC;
for (uint32_t i = 0; i < nitems; /* handled in loop */) {
if (arr[i].sign == arr[i + 1].sign) {
memmove( &arr[ i ], &arr[ i + 1 ], (nitems - i) * sizeof(signature));
nitems--;
}
else {
i++;
}
}
cookedWC = nitems;
return arr;
}
uint32_t getsig(char * word) {
uint32_t result = 0;
for (uint32_t i = 0; i < 5; i++) {
uint32_t bit = 1 << (word[i] & CHARMASK);
if (result & bit) {
// duplicate letters
return 0;
}
result |= bit;
}
return result;
}
2022-09-03 15:23:40 -04:00
signature* makeArray(FILE * f) {
2022-09-03 13:58:20 -04:00
signature* sigs = (signature*) calloc(WORDS, sizeof(signature));
char word[WORDLEN + sizeof(char)]; // 5 letters + \n
while (fread(word, sizeof(char), WORDLEN + sizeof(char), f) != 0) {
rawWC++;
// only assign sign so far, more efficient
uint32_t s = getsig(word);
if (s != 0) {
2022-09-03 15:23:40 -04:00
// no duplicate word letters in word
2022-09-03 13:58:20 -04:00
sigs[fiveUniqWC].word = strndup(word, 5);
sigs[fiveUniqWC].sign = s;
fiveUniqWC++;
}
}
return sigs;
}
int main(int argc, char * argv[]) {
2022-09-03 15:23:40 -04:00
#if TIME_SECTIONS
clock_t prog_start = clock();
#endif
#if ! ASSUME_SAFE
2022-09-03 13:58:20 -04:00
if (argc != 2) {
fprintf(stderr, "usage: %s file\n", argv[0]);
return 2;
}
2022-09-03 15:23:40 -04:00
#endif
2022-09-03 13:58:20 -04:00
FILE * f = fopen(argv[1], "r");
2022-09-03 15:23:40 -04:00
#if ! ASSUME_SAFE
2022-09-03 13:58:20 -04:00
if (f == NULL) {
fprintf(stderr, "%s: %s: no such file or directory\n", argv[0], argv[1]);
return 2;
}
2022-09-03 15:23:40 -04:00
#endif
START_TIME("making array")
signature* sigs = makeArray(f);
END_TIME
2022-09-03 13:58:20 -04:00
fclose(f);
2022-09-03 15:23:40 -04:00
#if PRINT_INTERMEDIATES
2022-09-03 13:58:20 -04:00
printf("read %u words\n", rawWC);
printf("kept %u words with 5 unique letters\n", fiveUniqWC);
2022-09-03 15:23:40 -04:00
#endif
2022-09-03 13:58:20 -04:00
2022-09-03 15:23:40 -04:00
START_TIME("sorting")
2022-09-03 13:58:20 -04:00
qsort(sigs, fiveUniqWC, sizeof(signature), compare);
2022-09-03 15:23:40 -04:00
END_TIME
START_TIME("removing duplicates")
sigs = rmdups(sigs);
END_TIME
#if PRINT_INTERMEDIATES
2022-09-03 13:58:20 -04:00
printf("ended with %u totally unique words\n", cookedWC);
2022-09-03 15:23:40 -04:00
#endif
START_TIME("finding words")
2022-09-03 13:58:20 -04:00
for (uint32_t i1 = 0; i1 < cookedWC; i1++) {
uint32_t a = sigs[i1].sign;
for (uint32_t i2 = i1+1; i2 < cookedWC; i2++) {
uint32_t b = sigs[i2].sign;
if (a & b) {
continue;
}
uint32_t ab = a | b;
2022-09-03 15:23:40 -04:00
#if PRINT_INTERMEDIATES
2022-09-03 13:58:20 -04:00
fprintf(stderr, "%s:%s\n", sigs[i1].word, sigs[i2].word);
#endif
for (uint32_t i3 = i2+1; i3 < cookedWC; i3++) {
uint32_t c = sigs[i3].sign;
if (ab & c) {
continue;
}
uint32_t abc = ab | c;
2022-09-03 15:23:40 -04:00
#if PRINT_INTERMEDIATES
2022-09-03 13:58:20 -04:00
fprintf(stderr, "%s:%s:%s\n", sigs[i1].word, sigs[i2].word, sigs[i3].word);
#endif
for (uint32_t i4 = i3+1; i4 < cookedWC; i4++) {
uint32_t d = sigs[i4].sign;
if (abc & d) {
continue;
}
uint32_t abcd = abc | d;
2022-09-03 15:23:40 -04:00
#if PRINT_INTERMEDIATES
2022-09-03 13:58:20 -04:00
fprintf(stderr, "%s:%s:%s:%s\n", sigs[i1].word, sigs[i2].word, sigs[i3].word, sigs[i4].word);
#endif
for (uint32_t i5 = i4+1; i5 < cookedWC; i5++) {
uint32_t e = sigs[i5].sign;
if (abcd & e) {
continue;
}
fprintf(stderr, "%s, %s, %s, %s, %s\n", sigs[i1].word, sigs[i2].word, sigs[i3].word, sigs[i4].word, sigs[i5].word);
2022-09-03 15:23:40 -04:00
#if FIND_ONE
goto loopend;
#endif
2022-09-03 13:58:20 -04:00
}
}
}
}
}
2022-09-03 15:23:40 -04:00
#if FIND_ONE
loopend:
#endif
END_TIME
#if TIME_SECTIONS
clock_t prog_end = clock();
printf("%s took %fs total\n", argv[0], ((double)(prog_end - prog_start)) / CLOCKS_PER_SEC);
2022-09-03 13:58:20 -04:00
#endif
return 0;
}