Tutorial

WizardSolver uses a function called PossibleWords[] to seek possible words.
The following tutorial will show how it works.

PossibleWords[format_,testlist_]
The first argument format is a regular expression.
It indicates some of the basic properties of the letters in the word.
The second argument testlist is a list of tests separated by seperators(;).
They are the further restrictions of the word.

Let's see an example.
Input: PossibleWords["#p@#4*s#@#!e#","&4+2=&5;GP[3,7,8];~6~7~8"]
Output: {"capacity"}

Index
Regular Expression
Word Test
Statistic Test
Function Test
Equation Test

Regular Expression

We use identifier(@, #, *) to represent a letter.
@ means a vowel, # means a consonant, and * means an unknown letter.
After a letter is declared, there may be some properties which the letter should fit.
The properties are indicated by patterns(a, c, d, e, f, l, p, s, u, 2, 3, 4, 5).
Opposition(!) implies an opposition of all the following patterns.
But the opposition will be reset after the next letter is declared.

• a (Axial Symmetry): abcdehikmotuvwxy
• c (Central Symmetry): hinosxz
• l (With Loop): abdopqr
• u (Unicursal): bcdgijlmnoprsuvwz
• p (Prime Number): bcegkmqsw
• d (Divisible Number): dfhijlnoprtuvxyz
• s (Square Number): adipy
• f (Square-Free): dhilprtxy
• e (Chemical Element): bcfhiknopsuvwy
• 2 (Multiple of 2): bdfhjlnprtvxz
• 3 (Multiple of 3): cfilorux
• 4 (Multiple of 4): dhlptx
• 5 (Multiple of 5): ejoty

Example:
Input: PossibleWords["@p*c#*f#!ae@#s",""]
Output: {"excited"}

Word Test

WizardSolver uses wave(~) to connect letters to form new words, prefixes and postfixes.

Statistic Test

Function Test

Equation Test