1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#!/usr/bin/env ruby

require 'set'

require 'pry'

DICT = Set.new(File.read('/usr/share/dict/words').split("\n").map(&:downcase))

forest = <<FOREST.chomp.split("\n").map {|i| i.split(//) }
ATLAKCAJL
LOENCALUE
LJOIKLESS
IAPSRESEA
GMAPETOAE
AERLETOGW
TLDNRAMRO
OEVEASAEL
RAEBTEXOF
FOREST

def forest.words(x, y, n=2)
  dirs = (1..n).map do |i|
    [[0,i], [0,-i], [i,0], [-i,0],
     [i,i], [i,-i], [-i,i], [-i,-i]]
  end
  dirs = (0..7).map {|i| [[0,0]].concat(dirs.map {|x| x[i] }) }

  words = dirs.map do |dir|
    word = dir.map do |xx,yy|
      next unless (0..8).cover?(x+xx) && (0..8).cover?(y+yy)
      self[x+xx][y+yy]
    end.join
  end.select {|word| (word.size == n+1) && DICT.include?(word.downcase) }
end

all = []
forest.size.times do |x|
  forest[x].size.times do |y|
    words = forest.words(x,y)
    next if words.empty?
    puts "(#{x},#{y}): #{words.join(', ')}"
    all.concat(words)
  end
end
# puts all.sort

# def all.ring(word)
#   word.size.times do |i|
#     r = word.dup
#     r[i] = '.'
#     poss = self.grep(Regexp.new(r)).reject {|w| w == word }
#     puts poss unless poss.empty?
#   end
# end

# binding.pry
#
# to jam eleven letters in cal use a grease