Ilia Denisov
15c7959d96
A Go library that returns every legal play ranked by score and scores or validates plays, using the Appel-Jacobson DAWG algorithm over github.com/iliadenisov/dafsa v1.1.0. - DAWG move generation (across / down / both), full tournament scoring with a per-tile breakdown; public Solver: GenerateMoves (ranked), ScorePlay, ValidatePlay. - Rulesets: English Scrabble, Russian Scrabble, Эрудит (parameterizable Ruleset). - cmd/builddict (build the DAWG from the dictionaries submodule), cmd/stress (self-play benchmark), selfplay engine; brute-force test oracle. - A GADDAG was implemented, benchmarked and removed (the DAWG was smaller and faster for a scoring solver); see RESULTS.md and ALGORITHM.md.
44 lines
1.1 KiB
Go
44 lines
1.1 KiB
Go
package graph_test
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/iliadenisov/alphabet"
|
|
dawg "github.com/iliadenisov/dafsa"
|
|
|
|
"scrabble-solver/internal/graph"
|
|
)
|
|
|
|
// TestSpellSmoke also exercises the go.mod replace => ../dafsa wiring and the new
|
|
// dafsa traversal API end-to-end from the solver module.
|
|
func TestSpellSmoke(t *testing.T) {
|
|
d := dawg.New(alphabet.Latin())
|
|
for _, w := range []string{"cat", "cats", "dog"} {
|
|
if err := d.Add(w); err != nil {
|
|
t.Fatalf("Add(%q): %v", w, err)
|
|
}
|
|
}
|
|
c, err := dawg.NewCursor(d.Finish())
|
|
if err != nil {
|
|
t.Fatal(err)
|
|
}
|
|
|
|
enc := func(s string) []byte {
|
|
b, err := alphabet.Latin().Encode(s)
|
|
if err != nil {
|
|
t.Fatalf("Encode(%q): %v", s, err)
|
|
}
|
|
return b
|
|
}
|
|
|
|
if _, final, ok := graph.Spell(c, enc("cat")); !ok || !final {
|
|
t.Errorf("Spell(cat): ok=%v final=%v, want both true", ok, final)
|
|
}
|
|
if _, final, ok := graph.Spell(c, enc("ca")); !ok || final {
|
|
t.Errorf("Spell(ca): ok=%v final=%v, want ok=true final=false", ok, final)
|
|
}
|
|
if _, _, ok := graph.Spell(c, enc("xyz")); ok {
|
|
t.Errorf("Spell(xyz): ok=true, want false")
|
|
}
|
|
}
|