Skip to content

A Boggle solver written in Rust and compiled to WebAssembly!

Notifications You must be signed in to change notification settings

parkuman/roggle

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

57 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

roggle logo

🦀 roggle 🔡

A Boggle Solver written in Rust and Compiled to WebAssembly!

crates.io crates.io Docs

About

Have you ever been playing Boggle and wished you could know all the solutions on the board? Wish no longer! Roggle is a Rust crate + NPM package that allows you to solve any N x M Boggle board.

Simply pass in an N x M board as a string with rows separated by spaces. For the Qu tile put q as the letter.

Example Usage

Board

 w  o  d  p
 d  j  i  k
 a  s  o  p
 s  a  Qu s

Code

Rust

use roggle;
use std::collections::HashSet;

fn main() {
  let board = "wodp djik asop saqs";
  let solutions: HashSet<String> = roggle::solve(board);
  println!("{:?}", solutions);
}

JavaScript

import init, { solve } from "roggle";

function solve_board() {
  const board = "wodp djik asop saqs";
  console.log(solve(board));
}

init().then(solve_board);

Under the Hood

Roggle is a Rust-based Boggle solver compiled to WebAssembly, allowing us to run it in the browser! For more info on the actual Rust implementation, check out the roggle crate on crates.io.

Roggle uses a Trie to breakdown the english dictionary into an easily searchable tree. It then recurses over each board tile, searching all neighbours for possible words until it finishes!

Dictionary

The dictionary used is a 466k word english dictionary. Some words are not super common (aaaa is a word apparently??), but Roggle would rather show you all possibilities then leave you in the dust with less points!

As with any game of boggle, feel free to argue which words are legal with your friends :)