Cleanup, path to correct solution

Author: themattman

README.md

@@ -58,10 +58,18 @@ the Checker is the "referee."
 
   - Basic game constraints defined here
 
+- `wordle_selectors.[h|cpp]`
+
+  - Selection Algorithms to feed to Solver
+
 - `wordle_solver.h`
 
   - Base class/interface for the Solver
 
+- `wordle_trie.[h|cpp]`
+
+  - Trie data structure used for Wordle
+
 - `wordlist_wordle_solver.[h|cpp]`
 
   - More intelligent solvers that use a dictionary

wordle_checker_test.cpp

@@ -73,5 +73,26 @@ what does this mean for my algo?
 can i make a new selector strategy?
 RandomSelector<iterable>
 
-
+answer: haute
+ guess: verve
+        BBBBG
+ guess: veest
+        BYBBY
+
+^^ this tells me that you must handle greens first for elimination... but also need letter frequency before being overaggressive for blacks
+store all locations of same letter. if only letter and black, then eliminate all.
+otherwise, 
+
+if freq > 1
+ yellow = eliminate current
+ black = eliminate current
+
+
+Black:
+if letterFreqInGuess == 1
+ removeAll
+else if letterFreqInGuess == 2 && 1 == G:
+ removeAllExcept(depth)
+else if letterFreqInGuess == 2 && 1 == Y:
+ 
  */

wordle_selectors.cpp

@@ -8,21 +8,16 @@ using namespace std;
 
 string RandomSelector::select(ForwardIterator begin, ForwardIterator end) {
     advance(begin, getRandom(begin, end));
-    cout << "selectFwd(" << *begin << ")" << endl;
     return *begin;
 }
 
 string RandomSelector::select(SetIterator begin, SetIterator end, size_t rangeSize) {
-    cout << "selectSet()" << endl;
-    cout << "selectSet(" << *begin << ")" << endl;
     advance(begin, getRandom(begin, end, rangeSize));
-    cout << "selectSet(" << *begin << ")" << endl;
     return *begin;
 }
 
 size_t RandomSelector::getRandom(ForwardIterator begin, ForwardIterator end) const {
     size_t numElements = end-begin;
-    cout << "numElems:" << numElements << "|" << rand() << endl;
     return rand() % numElements;
 }
 
@@ -131,7 +126,6 @@ void MostCommonLetterSelector::rateCandidates() {
     for (auto it = m_iterBegin; it != m_iterEnd; it++) {
         WordScore ws;
         ws.word = *it;
-        cout << "it:" << *it << endl;
         for (auto& c : ws.word) {
             auto letterScoreIt = m_frequencyMapWord.find(c);
             if (letterScoreIt != m_frequencyMapWord.end()) {
@@ -142,9 +136,7 @@ void MostCommonLetterSelector::rateCandidates() {
 
     sort(m_sortedWords.begin(), m_sortedWords.end(), compareWordScores);
     auto it = m_sortedWords.begin();
-    cout << "#1:" << it->word << endl;
     advance(it, 1);
-    cout << "#2:" << it->word << endl;
 }
 
 void MostCommonLetterSelector::computeFrequencyMap() {

wordle_trie.h

@@ -42,7 +42,7 @@ class WordleTrie {
         removeAllOfLetter(letter, *m_root);
     }
     string getCandidate(Selector* selector);
-    size_t getNumCandidates() const { cout << "numCands:" << m_candidates.size() << endl; return m_candidates.size(); }
+    size_t getNumCandidates() const { return m_candidates.size(); }
     void printCandidates();
 private:
     void insertAtNode(string prefix, string remainingWord, WordleTrieNode* node);

wordlist_wordle_solver.cpp

@@ -58,7 +58,6 @@ Tree
 
 WordlistWordleSolver::WordlistWordleSolver(Selector* s) : WordleSolver(s) {
     loadWordList([this](const string& word) -> void {
-        //wl.insert(word);
         m_wordlist.push_back(word);
         m_wordSet.insert(word);
         for (size_t i = 0; i < LETTER_COUNT; i++) {
@@ -97,9 +96,7 @@ TrieBasedWordleSolver::TrieBasedWordleSolver(Selector* s) : PassthroughWordleSol
 }
 
 string TrieBasedWordleSolver::makeInitialGuess() {
-    // cout << "initial trie g" << endl;
     if (m_trie->getNumCandidates() > 0) {
-        // cout << "initial trie g" << endl;
         string candidateWord = m_trie->getCandidate(m_selector);
         if (candidateWord.size() == 0) {
             throw;
@@ -112,14 +109,6 @@ string TrieBasedWordleSolver::makeInitialGuess() {
 
 string TrieBasedWordleSolver::makeSubsequentGuess() {
     return makeInitialGuess();
-    // if (m_trie->getNumCandidates() > 0) {
-    //     string candidateWord = m_trie->getCandidate();
-    //     if (candidateWord.size() == 0) {
-    //         throw;
-    //     }
-    //     return candidateWord;
-    // }
-    // throw;
 }
 
 void TrieBasedWordleSolver::processResult(const WordleGuess& guess) {

wordlist_wordle_solver.h

@@ -34,7 +34,7 @@ class PassthroughWordleSolver : public WordlistWordleSolver {
 public:
     using WordlistWordleSolver::WordlistWordleSolver;
     string makeInitialGuess() override { return m_selector->select(m_wordlist.begin(), m_wordlist.end()); }
-    string makeSubsequentGuess() override { cout << "subseq" << endl; return makeInitialGuess(); }
+    string makeSubsequentGuess() override { return makeInitialGuess(); }
     void processResult(const WordleGuess& guess) override {}
 };