an(6) [debian man page]
AN(6) Games Manual AN(6) NAME
an - Anagram generator SYNOPSIS
an [-w] [-c string] [-d dictionary] [-l number_words] [-m word_length] [-u string] [-n number_anagrams] [-h] [-v] [--words] [--contain string] [--dict dictionary] [--length number_words] [--minimum word_length] [--used string] [--number number_anagrams] [--help] [--ver- sion] PHRASE DESCRIPTION
an finds all anagrams which can be made from the letters in PHRASE, using words in the specified dictionary. The default is to use /usr/share/dict/words. OPTIONS
-w, --words Print words that the letters in PHRASE can make, then exit. -c, --contain string Only print anagrams which contain string. -d, --dict dictionary Use dictionary file to find words which the letters in PHRASE can make. -m, --minimum word_length Only include word which are at least word_length long. -u, --used string Considers that letters in string have already used when analyzing letters in PHRASE. Like --contain but doesn't print out string. -l, --length number_words Finds anagrams which have a maximum of number_words words in them. This is very useful when number of anagrams which are output is large. -n, --number number_anagrams Stops after finding number_anagrams anagrams. -h, --help Print a usage message on standard output, then exit. -v, --version Print version information on standard output, then exit. EXAMPLE
an -c imp 'Paul Martin' Finds anagrams for Paul Martin which contain the word imp. AUTHOR
Paul Martin <pm@debian.org> THANKS
Richard Jones (richard@deep-thought.org) - Coding and algorithm design of original version. Julian Assange (proff@suburbia.net) - Algorithm design of original version. Please note that the email addresses for Richard and Julian are from over ten years ago and probably no longer work. COPYRIGHT
Copyright (c) Paul Martin 2012. All rights reserved. AN(6)
Check Out this Related Man Page
BOGGLE(6) BSD Games Manual BOGGLE(6) NAME
boggle -- word search game SYNOPSIS
boggle [-bd] [-s seed] [-t time] [-w length] [+ [+]] [boardspec] DESCRIPTION
The object of boggle is to find as many words as possible on the Boggle board within the three minute time limit. A Boggle board is a four by four arrangement of Boggle cubes, each side of each cube displaying a letter of the alphabet or `qu'. Words are formed by finding a sequence of cubes (letters) that are in the game's dictionary. The (N+1)th cube in the word must be horizontally, vertically, or diagonally adjacent to the Nth cube. Cubes cannot be reused. Words consist solely of lower case letters and must be at least 3 letters long. Command line flags can be given to change the rules of the game. -b Run boggle in batch mode. A boardspec must also be given. The dictionary is read from stdin and a list of words appearing in boardspec is printed to stdout. -d Enable debugging output. -s seed Specify a seed seed other than the time of day. -t time Set the time limit for each game from the default 3 minutes to time seconds. -w length Change the minimum word length from 3 letters to length. + This flag allows a cube to be used multiple times, but not in succession. ++ This flag allows the same cubes to be considered adjacent to itself. boardspec A starting board position can be specified on the command line by listing the board left to right and top to bottom. Help is available during play by typing '?'. More detailed information on the game is given there. AUTHORS
Boggle is a trademark of Parker Brothers. Barry Brachman Dept. of Computer Science University of British Columbia BUGS
If there are a great many words in the cube the final display of the words may scroll off of the screen. (On a 25 line screen about 130 words can be displayed.) No word can contain a 'q' that is not immediately followed by a 'u'. When using the + or ++ options the display of words found in the board doesn't indicate reused cubes. The dictionary that NetBSD installs omits many words that belong in the English language, most notably inflected forms. BSD
September 23, 2006 BSD