README
¶
Find initial set of Possible Letters
The possible letters for a tile are given as the set:
pl := g | w + yd - w(row) - w(col) + y(row) + y(col) - ws
The match instruction for a word is given as:
mi := [pl1][pl2][pl3][pl4][pl5] | egrep [ye]
Where:
- g = self is green
- w = {all white tiles}
- yd = {all yellow duplicates}
- w(row) = {all white tiles in this row}
- w(col) = {all white tiles in this col}
- y(row) = {all yellow tiles in this row}
- y(col) = {all yellow tiles in this col}
- s = self
- ye = any yellow letters in non-intersection tiles
Reduce that set by any that have already been assigned
Once the sets of possible letters (pl) for each tile have been found, take the set of all starting letters and subtract all letters that have a known position (a set size of one). The remainder will be the letters that can still be used. Any possible letter that is not in that set can be eliminated.
Reduce that set again by valid words
Map each word's sets of possible letters against a broad dictionary. Reduce the 'pl' sets to the sets of letters in the matches.
Documentation
¶
Index ¶
- func ParseSolution(puzzle, solution string) string
- type Possibles
- type Solver
- func (s *Solver) Get(row, col int) (rune, rune)
- func (s *Solver) GetSolution(row, col int) rune
- func (s *Solver) Print()
- func (s *Solver) Serialize() string
- func (s *Solver) Set(row, col int, l, c rune)
- func (s *Solver) Size() int
- func (s *Solver) Solve() bool
- func (s *Solver) Solved() bool
- func (s *Solver) Tiles() []board.Tile
- func (s *Solver) TilesInCol(row, col int, matchColor rune) map[rune]int
- func (s *Solver) TilesInRow(row, col int, matchColor rune) map[rune]int
- func (s *Solver) WhiteTiles() map[rune]int
- func (s *Solver) YellowDupes() map[rune]int
- func (s *Solver) YellowEvenCol(i int) []rune
- func (s *Solver) YellowEvenRow(i int) []rune
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func ParseSolution ¶
ParseSolution returns the serialization of the game given a puzzle and a solution
Types ¶
type Solver ¶
type Solver struct {
// contains filtered or unexported fields
}
func (*Solver) GetSolution ¶
GetSolution returns the solution letter and color at row, col
func (*Solver) Print ¶
func (s *Solver) Print()
Print prints a representation of the solver state to the console
func (*Solver) TilesInCol ¶
TilesInCol returns the set of letters of a given color (and their count) adjacent to the given coord
func (*Solver) TilesInRow ¶
TilesInRow returns the set of letters of a given color (and their count) adjacent to the given coord
func (*Solver) WhiteTiles ¶
WhiteTiles returns the letters on all of the white tiles
func (*Solver) YellowDupes ¶
YellowDupes returns any yellow tile letters that are duplicates of each other
func (*Solver) YellowEvenCol ¶
YellowEvenCol returns the letters on yellow tiles in non-intersections for the given col
func (*Solver) YellowEvenRow ¶
YellowEvenRow returns the letters on yellow tiles in non-intersections for the given row
Source Files