Implement Scrabble move generator (DAWG) with English and Russian rules

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.

This commit is contained in:

Ilia Denisov

2026-06-01 16:07:32 +02:00

parent f51a1fe2f2

commit 15c7959d96

43 changed files with 3406 additions and 0 deletions

.gitignore

View File

@@ -0,0 +1,9 @@
 # Cached serialized dictionaries, built from the dictionaries/ submodule by
 # cmd/builddict. They are reproducible artifacts, not source.
 /testdata/*.dawg
 /testdata/*.gaddag
 /testdata/*.bin
 # Local scratch
 /tmp/
 *.pdf