-
Notifications
You must be signed in to change notification settings - Fork 0
/
algos.rb
58 lines (49 loc) · 1.36 KB
/
algos.rb
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
require 'set'
require './grid'
require './dict'
module Boggle
module Algos
class BruteForce
attr_reader :solutions
def initialize(grid, dict)
@grid = grid
@dict = dict
@solutions = Set.new
@cursor = []
@word = ""
@used = (0...GRID_SIZE).map{ (0...GRID_SIZE).map{ false } }
end
def solve
init_steps = (0...GRID_SIZE * GRID_SIZE).map{ |n| [n / GRID_SIZE, n % GRID_SIZE] }
explore!(init_steps)
end
private
def explore!(steps)
steps.each do |coord|
move_to!(coord)
@solutions << @word if @word.size >= 3 && @dict.exists?(@word)
explore!(next_steps)
move_back!
end
end
def next_steps
i, j = @cursor.last
coords = [[i-1, j], [i, j-1], [i-1, j-1], [i+1, j], [i, j+1], [i+1, j+1], [i-1, j+1], [i+1, j-1]]
coords.delete_if do |coord|
i, j = coord
i >= GRID_SIZE || i < 0 || j >= GRID_SIZE || j < 0 || @used[i][j] == true
end
end
def move_to!(coord)
@cursor << coord
@word += @grid.matrix[coord[0]][coord[1]]
@used[coord[0]][coord[1]] = true
end
def move_back!
i, j = @cursor.pop
@word = @word[0..-2]
@used[i][j] = false
end
end
end
end