Skip to main content
100%

A simple tool for finding the highest scoring words with a scrabble rack

✓ Published0🌍 Public
Aamundo
Last edited Mar 30, 2011
Created on Mar 30, 2011

This tool finds and displays the highest-scoring words playable from a given Scrabble rack. It reads a system dictionary file, filters words to those that can be spelled with the rack’s letters, and ranks them by their Scrabble letter values. The output is a plain-text list of scores and matching words, sorted ascending. The code uses Python’s built-in file iteration, string methods, and list comprehensions, with no external visualization libraries. It demonstrates a simple algorithmic approach to word scoring and rack-based filtering.

AI-generated description

Similar vizzes

Loading thumbnail…

Gist 0d3ef677475862ba439fd5dacfd4a60d

The visualization maps the scoring patterns of five-letter words, showing how letter positions and letter values contribute to total word scores. It displays a grid or distribution of words, likely sorted or clustered by score, with each word’s score calculated from per-letter point values and a bonus for non-repeated letters. The implementation uses Python’s pandas to load and transform the word list, adding columns for each letter’s position and score, while the letter-to-value mapping follows standard Scrabble tile distributions. The final score sums individual letter scores and adds a two-point bonus when all letters are unique, as seen in the `duplicates` logic. The rendering itself is not shown in the code, but the data processing relies on pandas dataframes and string operations to derive the visualization’s underlying dataset.

CConorAspell
69% match
Loading thumbnail…

find all the words that can be built using the letters in a list, as in Scrabble™.

This example finds all valid words that can be formed from a given set of letters, as in Scrabble™. It reads a system dictionary file (`/usr/share/dict/words`) and iterates through each word, checking whether every letter in the candidate word appears in the tile string and that no letter is used more times than it appears in the tiles. The core logic uses Python’s `set.issubset` for letter containment and `str.count` to verify letter frequencies. The user supplies the tile letters as a command-line argument, and matching words are printed to standard output.

Aamundo
65% match
Loading thumbnail…

Gist 901f4da6657c981e68620127130e3f23

This example presents a heuristic strategy for a word-guessing game, prioritizing candidate words based on letter values and positional constraints. The visualization shows a sorted list of possible words, with scores derived from Scrabble-like letter values, adjusted by a penalty for duplicate letters and a bonus for letters already eliminated from the vocabulary. The code uses pandas to map scores across columns (first through fifth) and applies custom logic via `special_heuristic` to filter vacant positions and remaining letters. The approach relies on DataFrame operations for sorting and filtering, with no external visualization library, as the output is a single recommended word.

CConorAspell
62% match
Loading thumbnail…

Gist 44d4055a4886e06298020ea9a02e7d48

The visualization recommends a word by identifying the row with the lowest score in a dataset, then randomly selecting one word from that row’s matching entries. It shows a data-driven selection process where the lowest-scoring candidate is chosen. The code uses pandas to filter rows by the minimum score and samples one word from the resulting subset. The example relies on a CSV-like data frame, with the `recommend_word` function operating on that data to produce a single word output. No external rendering libraries are used; the logic is purely computational in Python.

CConorAspell
56% match
Loading thumbnail…

Gist 9cae4888d477011e1083bb00dc773a1d

This visualization displays a grid of five-letter words, each row representing a word from the supplied CSV file. It shows how each word’s letters and their scores relate, with columns for each position and a total score. The code uses `d3.forceSimulation` to position the text elements, while the data comes from the embedded `word_pool.csv` file. Each word’s letter scores are visually encoded, and the `duplicates` flag is included in the dataset. The rendering relies on SVG text elements updated via D3’s data join, with no external libraries beyond D3.

CConorAspell
55% match
Loading thumbnail…

Gist 2ddd23e185defb909f5b269d22e7849e

This example demonstrates a Wordle-solving filter tool that narrows down possible answer words based on player feedback. It shows how the filter function progressively eliminates candidates using three types of constraints: letters known to be absent, letters confirmed in specific positions, and letters that are present but misplaced. The code uses pandas DataFrame operations with string containment checks and column-based equality comparisons to refine the word list. While no visualization library is used, the logic relies on pandas’ vectorized string methods and boolean indexing to efficiently process the word list, making it a practical data-cleaning component for a word-guessing game interface.

CConorAspell
55% match
Loading thumbnail…

Obligatory wordle coding

This example shows a command-line Wordle solver that filters the remaining possible five-letter words based on prior guesses and their result patterns. It uses the `click` library to parse comma-separated guesses and results, then computes letter constraints through Python list comprehensions and the `itertools.product` function to generate candidate words. The script prints all possibilities, or a message indicating too many when the combination count exceeds 10,000, leveraging the `math.prod` function for efficient count calculation.

Aandyreagan
53% match
Loading thumbnail…

Arithmetic Billiards Racks

This visualization shows the exhaustive search for arithmetic billiards racks, where each rack is a triangular arrangement of numbered balls where adjacent pairs combine via addition or absolute difference to produce the ball below. The code enumerates all possible starting configurations and recursively fills each row, displaying complete racks with remaining balls listed. It uses Python’s `copy.deepcopy` and custom `rack` and `row` classes to track and print valid arrangements, with the final output summarizing counts of racks by size.

BBBischof
53% match