Search

PythonReactSEOPDF
OpenClaw

boggle

Solve Boggle boards — find all valid words (German + English) on a 4x4 letter grid. Use when the user shares a Boggle photo, asks for words on a grid, or plays word games. Includes 1.7M word dictionaries (DE+EN).

christianhaberl0 source installs☆ 0 Repository stars

Installation

Follow the repository instructions for this skill and your agent. Review the files and dependencies before adding it to your workflow.

SkillHub CLI

skillhub install christianhaberl/boggle

Inspect the source and compatibility requirements, then follow its installation steps.

Give your agent the source link and ask it to inspect instructions and dependencies before explaining the installation steps.

View source ↗Guides

Skill instructions

Boggle Solver

Fast trie-based DFS solver with dictionary-only matching. No AI/LLM guessing — words are validated exclusively against bundled dictionaries (359K English + 1.35M German).

Workflow (from photo)

  1. Read the 4x4 grid from the photo (left-to-right, top-to-bottom)
  2. Show the grid to the user and ask for confirmation before solving
  3. Only after user confirms → run the solver
  4. Always run English and German SEPARATELY — present as two labeled sections (🇬🇧 / 🇩🇪)

Solve a board

# English
python3 skills/boggle/scripts/solve.py ELMU ZBTS ETVO CKNA --lang en

# German
python3 skills/boggle/scripts/solve.py ELMU ZBTS ETVO CKNA --lang de

Each row is one argument (4 letters). Or use --letters:

python3 skills/boggle/scripts/solve.py --letters ELMUZBTSETVOCKNA --lang en

Options

Flag Description
--lang en/de Language (default: en; always run EN and DE separately)
--min N Minimum word length (default: 3)
--json JSON output with scores
--dict FILE Custom dictionary (repeatable)

Scoring (standard Boggle)

  • 3-4 letters: 1 pt
  • 5 letters: 2 pts
  • 6 letters: 3 pts
  • 7 letters: 5 pts
  • 8+ letters: 11 pts

How it works

  • Builds a trie from dictionary files (one-time, ~11s)
  • DFS traversal from every cell, pruned by trie prefixes
  • Adjacency: 8 neighbors (horizontal, vertical, diagonal)
  • Each cell used at most once per word
  • Qu tile support: Standard Boggle "Qu" tiles are handled as a single cell (e.g., QUENHARI... → "QU" occupies one position)
  • All matching is dictionary-only — no generative/guessed words

Data

Dictionaries are auto-downloaded from GitHub on first run if missing.

  • data/words_english_boggle.txt — 359K English words
  • data/words_german_boggle.txt — 1.35M German words

Performance

  • Trie build: ~11s (first run, 1.7M words)
  • Solve: <5ms per board

Source information

Source
github
Repository
openclaw/skills
Path
skills/christianhaberl/boggle
Version
—
Commit
baf44279fb4f51f655c643bc7c72599e34ddc8c7
Classification source
rules
Status
active
Visibility
public

These signals come from indexed source analysis and may lag behind changes. Check the current source files.

README

🎲 Boggle Solver — OpenClaw Skill

Fast trie-based DFS Boggle solver for OpenClaw.

Features

  • 1.7M dictionary words — 359K English + 1.35M German
  • Qu-tile support — standard Boggle rules
  • < 5ms solve time per board
  • JSON output with Boggle scoring
  • Bilingual — run English and German separately

Install

clawdhub install boggle

Or manually copy the skills/boggle/ folder into your OpenClaw workspace.

Usage

# English
python3 scripts/solve.py ELMU ZBTS ETVO CKNA --lang en

# German
python3 scripts/solve.py ELMU ZBTS ETVO CKNA --lang de

# With --letters flag
python3 scripts/solve.py --letters ELMUZBTSETVOCKNA --lang en

# JSON output
python3 scripts/solve.py ELMU ZBTS ETVO CKNA --lang en --json

Options

Flag Description
--lang en/de Dictionary language (default: en)
--min N Minimum word length (default: 3)
--json JSON output with scores
--dict FILE Custom dictionary (repeatable)

Scoring (standard Boggle)

  • 3-4 letters: 1 pt
  • 5 letters: 2 pts
  • 6 letters: 3 pts
  • 7 letters: 5 pts
  • 8+ letters: 11 pts

How it works

  • Builds a trie from dictionary files
  • DFS traversal from every cell, pruned by trie prefixes
  • Adjacency: 8 neighbors (horizontal, vertical, diagonal)
  • Each cell used at most once per word
  • Qu tiles handled as single cell
  • All matching is dictionary-only — no AI guessing

AI-Reviewed

This skill was reviewed by Codex and Gemini Code Assist across 5 review rounds. All findings addressed.

License

MIT

Extracted content

SKILL.md
# Boggle Solver

Fast trie-based DFS solver with dictionary-only matching. No AI/LLM guessing — words are validated exclusively against bundled dictionaries (359K English + 1.35M German).

## Workflow (from photo)

1. **Read the 4x4 grid** from the photo (left-to-right, top-to-bottom)
2. **Show the grid to the user and ask for confirmation** before solving
3. Only after user confirms → run the solver
4. **Always run English and German SEPARATELY** — present as two labeled sections (🇬🇧 / 🇩🇪)

## Solve a board

```bash
# English
python3 skills/boggle/scripts/solve.py ELMU ZBTS ETVO CKNA --lang en

# German
python3 skills/boggle/scripts/solve.py ELMU ZBTS ETVO CKNA --lang de
```

Each row is one argument (4 letters). Or use `--letters`:
```bash
python3 skills/boggle/scripts/solve.py --letters ELMUZBTSETVOCKNA --lang en
```

## Options

| Flag | Description |
|---|---|
| `--lang en/de` | Language (default: en; **always run EN and DE separately**) |
| `--min N` | Minimum word length (default: 3) |
| `--json` | JSON output with scores |
| `--dict FILE` | Custom dictionary (repeatable) |

## Scoring (standard Boggle)

- 3-4 letters: 1 pt
- 5 letters: 2 pts
- 6 letters: 3 pts
- 7 letters: 5 pts
- 8+ letters: 11 pts

## How it works

- Builds a trie from dictionary files (one-time, ~11s)
- DFS traversal from every cell, pruned by trie prefixes
- Adjacency: 8 neighbors (horizontal, vertical, diagonal)
- Each cell used at most once per word
- **Qu tile support:** Standard Boggle "Qu" tiles are handled as a single cell (e.g., `QUENHARI...` → "QU" occupies one position)
- **All matching is dictionary-only** — no generative/guessed words

## Data

Dictionaries are auto-downloaded from GitHub on first run if missing.


- `data/words_english_boggle.txt` — 359K English words
- `data/words_german_boggle.txt` — 1.35M German words

## Performance

- Trie build: ~11s (first run, 1.7M words)
- Solve: <5ms per board
README
# 🎲 Boggle Solver — OpenClaw Skill

Fast trie-based DFS Boggle solver for [OpenClaw](https://github.com/openclaw/openclaw).

## Features

- **1.7M dictionary words** — 359K English + 1.35M German
- **Qu-tile support** — standard Boggle rules
- **< 5ms solve time** per board
- **JSON output** with Boggle scoring
- **Bilingual** — run English and German separately

## Install

```bash
clawdhub install boggle
```

Or manually copy the `skills/boggle/` folder into your OpenClaw workspace.

## Usage

```bash
# English
python3 scripts/solve.py ELMU ZBTS ETVO CKNA --lang en

# German
python3 scripts/solve.py ELMU ZBTS ETVO CKNA --lang de

# With --letters flag
python3 scripts/solve.py --letters ELMUZBTSETVOCKNA --lang en

# JSON output
python3 scripts/solve.py ELMU ZBTS ETVO CKNA --lang en --json
```

## Options

| Flag | Description |
|---|---|
| `--lang en/de` | Dictionary language (default: en) |
| `--min N` | Minimum word length (default: 3) |
| `--json` | JSON output with scores |
| `--dict FILE` | Custom dictionary (repeatable) |

## Scoring (standard Boggle)

- 3-4 letters: 1 pt
- 5 letters: 2 pts
- 6 letters: 3 pts
- 7 letters: 5 pts
- 8+ letters: 11 pts

## How it works

- Builds a trie from dictionary files
- DFS traversal from every cell, pruned by trie prefixes
- Adjacency: 8 neighbors (horizontal, vertical, diagonal)
- Each cell used at most once per word
- Qu tiles handled as single cell
- **All matching is dictionary-only** — no AI guessing

## AI-Reviewed

This skill was reviewed by **Codex** and **Gemini Code Assist** across 5 review rounds. All findings addressed.

## License

MIT

Related skills

OpenClaw

bambu-studio-ai

heyixuan2

Bambu Lab 3D printer control and automation. Activate when user mentions: printer status, 3D printing, slice, analyze model, generate 3D, AMS filament, print monitor, Bambu Lab, or any 3D printing task. Full pi...

OpenClaw

geo-optimization

capt-marbles

Generative Engine Optimization (GEO) for AI search visibility. Optimize content to appear in ChatGPT, Perplexity, Claude, and Google AI Overviews. Use when optimizing websites, pages, or content for LLM discove...

OpenClaw

0protocol

0isone

Agents can sign plugins, rotate credentials without losing identity, and publicly attest to behavior.

OpenClaw

0x0-messenger

eijiac24

Send and receive P2P messages using disposable numbers and PINs. No servers, no accounts. Use for human notifications, approval flows, and agent-to-agent communication.