birdulon
/
wordle-rs
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

new word set

This commit is contained in:
Luke Hubmayer-Werner 2022-02-05 16:45:20 +10:30
parent 3d257fcd86
commit b3d316724b
2 changed files with 12981 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
src/main.rs
View File

@ -10,7 +10,7 @@ type Achar = i8; // ASCII char
const WORD_LENGTH: usize = 5; const WORD_LENGTH: usize = 5;
const WORD_LENGTH_P: usize = 5; // Padded for SIMD shenanigans const WORD_LENGTH_P: usize = 5; // Padded for SIMD shenanigans
const GUESS_DEPTH: usize = 2; const GUESS_DEPTH: usize = 1; // TODO: Change this whenever working at different depths
const A: Achar = 'A' as Achar; const A: Achar = 'A' as Achar;
const Z: Achar = 'Z' as Achar; const Z: Achar = 'Z' as Achar;
@ -175,7 +175,7 @@ fn find_word_id_from_str(s: &str, words: &Vec<Word>) -> usize {
fn main() { fn main() {
fs::write("test.txt", ["test1", "test2", "test3"].join("\n")).expect("Failed to write output"); fs::write("test.txt", ["test1", "test2", "test3"].join("\n")).expect("Failed to write output");
let words = load_dictionary("wordle-wordlist"); let words = load_dictionary("words-kura");
let totalwords = words.len(); let totalwords = words.len();
println!("Hello, world! {} words in dict", totalwords); println!("Hello, world! {} words in dict", totalwords);
let wordcache = generate_wordcache(words); let wordcache = generate_wordcache(words);
@ -186,14 +186,12 @@ fn main() {
//(0..=5).flat_map(|i| (i..=5).map(move |j| (i,j))).map(|(i,j)| print!("{},{}\t", i, j)); //(0..=5).flat_map(|i| (i..=5).map(move |j| (i,j))).map(|(i,j)| print!("{},{}\t", i, j));
// Depth-2 full // Depth-2 full
let mut results: Vec<(String, usize)> = // let mut results: Vec<(String, usize)> =
(0..totalwords).into_par_iter().flat_map_iter(|i| (i..totalwords).map(move |j| (i,j))) // (0..totalwords).into_par_iter().flat_map_iter(|i| (i..totalwords).map(move |j| (i,j)))
.map(|(i, j)| find_worstcase([i, j], &wordcache)).collect(); // .map(|(i, j)| find_worstcase([i, j], &wordcache)).collect();
// Depth-1 full // Depth-1 full
// let mut results: Vec<(String, usize)> = let mut results: Vec<(String, usize)> = (0..totalwords).into_par_iter().map(|i| find_worstcase([i], &wordcache)).collect();
// (0..totalwords).into_par_iter()
// .map(|i| find_worstcase([i], &wordcache)).collect();
// Depth-3 (word1,word2,?) // Depth-3 (word1,word2,?)
// let i1 = find_word_id_from_str("CARET", &wordcache[&0]); // let i1 = find_word_id_from_str("CARET", &wordcache[&0]);
@ -201,8 +199,7 @@ fn main() {
// let i3 = find_word_id_from_str("NYMPH", &wordcache[&0]); // let i3 = find_word_id_from_str("NYMPH", &wordcache[&0]);
// let i4 = find_word_id_from_str("FIFTH", &wordcache[&0]); // let i4 = find_word_id_from_str("FIFTH", &wordcache[&0]);
// let mut results: Vec<(String, usize)> = // let mut results: Vec<(String, usize)> =
// (0..totalwords).into_par_iter() // (0..totalwords).into_par_iter().map(|i| find_worstcase([i1, i2, i3, i4, i], &wordcache)).collect();
// .map(|i| find_worstcase([i1, i2, i3, i4, i], &wordcache)).collect();
results.sort_by_key(|r| r.1); results.sort_by_key(|r| r.1);
let results_strs: Vec<String> = results.iter().map(|r| r.0.clone()).collect(); let results_strs: Vec<String> = results.iter().map(|r| r.0.clone()).collect();

12974
words-kura Normal file
View File

File diff suppressed because it is too large Load Diff