codewords_solver 0.0.2 → 0.0.3

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: f4886e4d8eb69c91a00c9c8d9aacab82dc3a6b1957a586e1789a4a3b94b0b92c
-  data.tar.gz: 19c61ba5ff23c5a3a0cc10a9306a5a818ccd24791a2cac3a5ba9c75b6f286568
+  metadata.gz: 8e22e424b515d90124d77fdc91aed5a3f7837155319a257b2af480e377ef5b18
+  data.tar.gz: e8d8b37d0b9b98ac5529a34b9a21385512944d1171bd413cdb176723c65a34bf
 SHA512:
-  metadata.gz: 8647b9cc57b9e004a58141d571a62f3d2a4b4336eac4e3575aea018055ddb52782b8fe3a5534b365591454c78dde4fbe040cc7fce530ccc481088c3ca159c361
-  data.tar.gz: a82e7e300ce1162def0024db9ad268c0036f1c183b81f5928eab080f09e92b0d860ec8df376ccb2c755d7449f5e4f534de58ab5d784f6db36410f8188128d839
+  metadata.gz: ef8ce498d02038c4db158dfe9c111b8b987b9fa2252753841a88d2ad7fb58b087aed970e09f37ab021c155a6352e5d8cdd9c85690932e39682c26ac2b7697b05
+  data.tar.gz: 50951b1cb93f810c7e58c991bf44791b89e768a6af1cfd27b0d1813f285b6d8923f5d52cdd46e94c22b6fe779a5c8beb1353a36dea755771ead030d2de1c408f

data/Gemfile.lock

@@ -1,7 +1,7 @@
 PATH
   remote: .
   specs:
-    codewords_solver (0.0.1)
+    codewords_solver (0.0.3)
       activesupport (~> 7.1)
 
 GEM

data/README.md

@@ -49,6 +49,12 @@ grid = [
   [22, 21, 17, 4, 15, 7, 17, 17, 19],
 ]
 ```
+
+which is a machine-representation of a real-world grid that looks like this:
+
+![IMG_2891](https://github.com/johansenja/codewords_solver/assets/43235608/27741a76-9a14-4dba-b25c-a59a89fcc51d)
+
+
 **Note that while a codewords puzzle is typically formed into a grid with intersecting words, you do not need to mark such intersections here. A simple array of each of the numbered words will suffice!**
 
 ### Please note

data/lib/codewords_solver/dictionary.rb

@@ -4,16 +4,26 @@ class CodewordsSolver
   class Dictionary
     include ActiveSupport::Inflector
 
+    DEFAULT_FILEPATH = File.join(__dir__, "..", "..", "word_list.txt")
+
     def initialize
-      @words = import_words_by_filepath(
-        File.join(__dir__, "..", "..", "word_list.txt")
-      )
+      load!
     end
 
     def find_by_regexp(regexp)
       @words.filter { |w| w.length > 2 and w.match? regexp }
     end
 
+    def has?(word)
+      @words.include? word
+    end
+
+    def load!
+      @words = import_words_by_filepath(DEFAULT_FILEPATH)
+    end
+
+    alias_method :reload!, :load!
+
     private
 
     def import_words_by_filepath(filepath)

data/lib/codewords_solver/version.rb

@@ -1,3 +1,3 @@
 class CodewordsSolver
-  VERSION = "0.0.2".freeze
+  VERSION = "0.0.3".freeze
 end

data/lib/codewords_solver.rb

@@ -1,19 +1,20 @@
-require "codewords_solver/dictionary"
+require_relative "codewords_solver/dictionary"
 
 class CodewordsSolver
-  def self.solve!(coded_words:, starting_letters:)
-    new(coded_words, starting_letters).solve!
+  def self.solve!(coded_words:, starting_letters:, **rest)
+    new(coded_words, starting_letters, **rest).solve!
   end
 
   MAX_LOOP_ATTEMPTS = 5
 
-  def initialize(coded_words, starting_letters)
+  def initialize(coded_words, starting_letters, debug: false)
     @coded_words = coded_words
     @starting_letters = starting_letters
     @letters_by_number = (1..26).to_h { |n| [n, nil] }.merge(
       starting_letters.transform_values(&:upcase)
     )
     @dictionary = Dictionary.new
+    @debug = debug
   end
 
   def solve!
@@ -52,9 +53,11 @@ class CodewordsSolver
       # this is a bit of a leak/hack; at this point, we're going a bit beyond regex's capabilities
       possibilities = filter_invalid_possibilities(possibilities, coded_word)
 
-      # puts(
-      #   "Found #{possibilities.length > 10 ? possibilities.length : possibilities.join(", ")} for #{coded_word} (regexp: /#{regexp}/)"
-      # )
+      if @debug
+        puts(
+          "Found #{possibilities.length > 10 ? possibilities.length : possibilities.join(", ")} for #{coded_word} (regexp: /#{regexp}/)"
+        )
+      end
 
       assign_word(coded_word, possibilities[0]) if possibilities.length == 1
 
@@ -68,6 +71,7 @@ class CodewordsSolver
         end
       end
 
+      try_to_fill_last_letter
       break if complete?
     end
   end
@@ -102,6 +106,21 @@ class CodewordsSolver
     @letters_by_number.each_value.all? { |letter| !letter.nil? }
   end
 
+  # in cases where there is only one letter remaining, but the word that it spells isn't in the
+  # dictionary, then this will put the final piece into place via process of elimination
+  def try_to_fill_last_letter
+    remaining = unassigned_letters
+
+    return unless remaining.length == 1
+
+    @letters_by_number.each do |num, val|
+      next if val
+
+      @letters_by_number[num] = remaining[0]
+      break
+    end
+  end
+
   def filter_invalid_possibilities(possibilities, coded_word)
     possibilities.filter { |poss| poss.chars.uniq.length == coded_word.uniq.length }
   end
@@ -114,9 +133,15 @@ class CodewordsSolver
 
   def print_words
     words = @coded_words.map do |code_word|
-      code_word.each_with_object("") do |number, word|
-        word << @letters_by_number[number]
+      word = code_word.each_with_object("") do |number, str|
+        str << @letters_by_number[number]
       end
+
+      unless @dictionary.has? word
+        puts "!! #{word} not in dictionary - consider adding it to word_list.txt"
+      end
+
+      word
     end
 
     max_word_length = words.max_by(&:length).length
@@ -126,11 +151,13 @@ class CodewordsSolver
     end
   end
 
+  def unassigned_letters
+    ("A".."Z").to_a - @letters_by_number.values.reject(&:nil?)
+  end
+
   def to_regexp(coded_word)
     backreferences_for_unknown_numbers = []
 
-    unassigned_letters = ("A".."Z").to_a.join("").tr @letters_by_number.values.join(""), ""
-
     regexp_chars = coded_word.map do |number|
       letter = @letters_by_number[number]
       next letter if letter
@@ -139,7 +166,7 @@ class CodewordsSolver
 
       if backreference_num.nil?
         backreferences_for_unknown_numbers << number
-        "(#{unassigned_letters.split("").join("|")})"
+        "(#{unassigned_letters.join("|")})"
       else
         "\\#{backreference_num + 1}"
       end

data/word_list.txt

@@ -129,6 +129,7 @@ adelaide
 adequate
 adidas
 adipex
+adieu
 adjacent
 adjust
 adjustable
@@ -222,6 +223,7 @@ agreements
 agrees
 agricultural
 agriculture
+ague
 ahead
 aid
 aids
@@ -791,6 +793,7 @@ battery
 battle
 battlefield
 bay
+bazaar
 bbc
 bbs
 bbw
@@ -836,6 +839,7 @@ beginner
 beginners
 beginning
 begins
+beguile
 begun
 behalf
 behavior
@@ -934,6 +938,7 @@ biotechnology
 bird
 birds
 birmingham
+biro
 birth
 birthday
 bishop
@@ -1313,6 +1318,7 @@ carefully
 carey
 cargo
 caribbean
+caribou
 caring
 carl
 carlo
@@ -1648,6 +1654,7 @@ clouds
 cloudy
 club
 clubs
+clue
 cluster
 clusters
 cms
@@ -2302,6 +2309,7 @@ dee
 deemed
 deep
 deeper
+deepness
 deeply
 deer
 def
@@ -2821,11 +2829,13 @@ effort
 efforts
 egg
 eggs
+ego
 egypt
 egyptian
 eight
 either
 ejaculation
+elbow
 elder
 elderly
 elect
@@ -2841,6 +2851,8 @@ electron
 electronic
 electronics
 elegant
+elegise
+elegize
 element
 elementary
 elements
@@ -3108,6 +3120,7 @@ exempt
 exemption
 exercise
 exercises
+exert
 exhaust
 exhibit
 exhibition
@@ -3291,6 +3304,7 @@ feelings
 feels
 fees
 feet
+feetless
 fell
 fellow
 fellowship
@@ -3306,6 +3320,7 @@ festivals
 fetish
 fever
 few
+fiance
 fewer
 fiber
 fibre
@@ -3497,6 +3512,7 @@ forming
 forms
 formula
 fort
+fortress
 forth
 fortune
 forty
@@ -3828,6 +3844,9 @@ grey
 grid
 griffin
 grill
+grind
+grinds
+grinder
 grip
 grocery
 groove
@@ -3843,6 +3862,7 @@ growing
 grown
 grows
 growth
+grubby
 gsm
 gst
 gtk
@@ -3996,6 +4016,7 @@ heavily
 heavy
 hebrew
 heel
+heedless
 height
 heights
 held
@@ -4517,6 +4538,7 @@ involvement
 involves
 involving
 ion
+iota
 iowa
 ipaq
 ipod
@@ -4649,6 +4671,7 @@ journals
 journey
 joy
 joyce
+joyful
 jpeg
 jpg
 juan
@@ -4708,6 +4731,7 @@ kent
 kentucky
 kenya
 kept
+kerb
 kernel
 kerry
 kevin
@@ -4892,6 +4916,7 @@ legislation
 legislative
 legislature
 legitimate
+lego
 legs
 leisure
 lemon
@@ -5167,6 +5192,7 @@ maintained
 maintaining
 maintains
 maintenance
+maize
 major
 majority
 make
@@ -5251,6 +5277,8 @@ marshall
 mart
 martha
 martial
+martian
+martians
 martin
 marvel
 mary
@@ -5334,6 +5362,7 @@ meditation
 mediterranean
 medium
 medline
+meekness
 meet
 meeting
 meetings
@@ -5594,6 +5623,7 @@ mounted
 mounting
 mounts
 mouse
+mousse
 mouth
 move
 moved
@@ -5663,6 +5693,7 @@ name
 named
 namely
 names
+namesake
 namespace
 namibia
 nancy
@@ -5953,8 +5984,10 @@ only
 ons
 ontario
 onto
+onus
 ooo
 oops
+opal
 open
 opened
 opening
@@ -5992,6 +6025,7 @@ options
 oracle
 oral
 orange
+oratory
 orbit
 orchestra
 order
@@ -6059,6 +6093,7 @@ overcome
 overhead
 overnight
 overseas
+oversleep
 overview
 owen
 own
@@ -6228,6 +6263,8 @@ peas
 pediatric
 pee
 peeing
+peel
+peeled
 peer
 peers
 pen
@@ -7044,6 +7081,7 @@ reduction
 reductions
 reed
 reef
+reefer
 reel
 ref
 refer
@@ -7417,6 +7455,7 @@ routines
 routing
 rover
 row
+rowlock
 rows
 roy
 royal
@@ -7568,6 +7607,7 @@ scotland
 scott
 scottish
 scout
+scramble
 scratch
 screen
 screening
@@ -7730,6 +7770,7 @@ shakespeare
 shakira
 shall
 shame
+shampoo
 shanghai
 shannon
 shape
@@ -8093,6 +8134,7 @@ squad
 square
 squirt
 squirting
+squishy
 src
 sri
 ssl
@@ -8471,6 +8513,7 @@ target
 targeted
 targets
 tariff
+tartan
 task
 tasks
 taste
@@ -8506,6 +8549,9 @@ techrepublic
 ted
 teddy
 tee
+teem
+teeming
+teemed
 teen
 teenage
 teens
@@ -9018,6 +9064,7 @@ unsubscribe
 until
 untitled
 unto
+unused
 unusual
 unwrap
 upc
@@ -9037,6 +9084,7 @@ ups
 upset
 upskirt
 upskirts
+upstream
 urban
 urge
 urgent
@@ -9294,6 +9342,7 @@ warned
 warner
 warning
 warnings
+warplane
 warrant
 warranties
 warranty
@@ -9570,8 +9619,10 @@ zambia
 zdnet
 zealand
 zen
+zeolite
 zero
 zimbabwe
+zillion
 zinc
 zip
 zoloft

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: codewords_solver
 version: !ruby/object:Gem::Version
-  version: 0.0.2
+  version: 0.0.3
 platform: ruby
 authors:
 - Joseph Johansen
 autorequire:
 bindir: bin
 cert_chain: []
-date: 2024-01-17 00:00:00.000000000 Z
+date: 2024-02-13 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: activesupport