Free franklin cwp 206 crossword puzzle solver software for linux

Asymptopia Crossword Builder project is a math and text crossword builder for education.
Asymptopia Crossword Builder is a JavaScript education application. Through the GUI, you can automatically generate unlimited math crosswords (add/sub/mult/div/alg/frac) or enter/paste your own lists of key:hint pairs. It is educational, and keeps kids busy.
Enhancements:
- Source code is now available for download.
- The project license has changed to the GNU Public License (GPL).

Cryptogram Puzzle Tool project helps solve the simple cryptogram puzzles that appear in the daily newspapers. While these puzzles can often be solved almost by inspection, CPT4 provides a handy tool for the ones that turn out to be not quite so easy.
If you just want a little bookkeeping help, CPT4 will instantly update all occurrences of the new assignments as well as provide frequency and used/not-used letter lists as you drag-and-drop or key in suspected solution letters. But if youd rather have the computer do the work, the automatic solution algorithm will usually come very close to a complete solution in just a few seconds.
Bonus: CPT4 can also create new puzzles: simply key in or load plaintext from a file, and select the Encrypt item from the Options menu.
Installing / Building / Running:
Start by unpacking in a directory where you have write permissions; all tar files create and populate a cpt4/ directory and contain sample puzzles as well as various information.
For the source distribution, change to the cpt4 directory and just type make. You may get a few warnings while compiling do_hart.c, but otherwise the executables cpt4 and do_hart should be built after a short time and a few intermediate steps. If this does not happen and you are not knowledgeable about such things, you might try the shared library executable distribution instead.
For the 4.1.x shared library executables, you may need to supply a font alias file in a location that the precompiled Pango routines can find; the easiest way to do this is to just copy the two files .pangorc and pangox.aliases from the installation directory into to your $HOME directory. If you use the source distributions, of course, you will need to have a complete Pango installation before you start.
Once you have the executables, try out the program by changing to the installation directory and issuing the command line:
./cpt4
Use the File->Load menu item to load one of the samples (xxxxx.cpt) and play with the controls. Try the Options->Hart Solution menu item to see the automatic solution in action.
If the puzzle text is uncomfortably small or large on your system, you can specify a different font on the command line like this:
./cpt4 -large
./cpt4 -small
With the 4.0.x and 4.1.x versions (but not the 4.2.x versions) you can also specify a font by name like this:
./cpt4 -font="font-name"
For the 4.0.1 versions (with GTK 1.2), the font MUST be monospaced and is expected to be iso8859-1; other characters sets may also work but might produce a different effect. The font-name for these versions of cpt4 must be an X logical font name such as "*clean-bold-r*--16*".
For the 4.1.x versions (with Pango), monospaced fonts will generally produce more pleasing results, but proportional fonts of sufficiently small size may also work; the main requirement is that the ASCII characters ! through ~ be portrayed as expected. Font-name for these versions must be a Pango font name, such as "courier bold 11", "sans 8", "Times 8", and so forth.
If you want just want to run CPT4 from the command line, it is sufficient to put a soft link to cpt4 from somewhere in your PATH and leave both the cpt4 and do_hart executables in the installation directory. For example, as root:
cd /usr/bin
ln -s /home/johndoe/cpt4/cpt4
A 32x32 CPT4 icon in .xpm format is included in all distributions for use in desktop shortcuts.
Enhancements:
- This release changes fixed width font logic, including special cursor logic using the fixed fonts, to preprocessed fonts supplied as C header files, instead of using Pango routines and arbitrary fonts.
- It has been updated to use glib 2.6.1, Gtk+2.6.1, Pango 1.8.0, atk 1.9.0, and associated packages as supplied in Slackware 10.0. Functionality is virtually unchanged.

Polygon Puzzle project is a tessellation puzzle inspired by Beat The Computer. Pieces of connecting regular polygons are arranged to fit into predefined trays.
The mathematical names of the shapes are polyhexes, polyominoes, and polyiamonds.
Enhancements:
- Two new puzzle trays with more sophisticated color schemes were added.
- Minor changes were made to error handling along with a small bugfix and support for the wheel mouse under Windows XP.

Crossword allows you to try to solve crossword puzzles.
Crossword is a GNOME game that draws a crossword grid and clues for you to solve based on a configuration file.
It also has an editor to let you easily create puzzles.
Enhancements:
- Initial release! :)
- Currently can draw the board and the clues
- The interface needs a lot of work
- The editor has hardly been started, and is not usable
- The file format has been mostly finalized, so you can create files with a hex editor (not a text editor)

PHP/Javascript Jigsaw puzzle automatically creates jigsaw puzzles from a folder of images.
Enhancements:
- javascript libary

A Sudoku Solver in C is a console-based Linux program, written in C language, that solves Su Doku puzzles using deductive logic. It will only resort to trial-and-error and backtracking approaches upon exhausting its deductive moves.
Puzzles must be of the standard 9x9 variety using the (ASCII) characters 1 through 9 for the puzzle symbols. Puzzles should be submitted as 81 character strings which, when read left-to-right will fill a 9x9 Sudoku grid from left-to-right and top-to-bottom. In the puzzle specification, the characters 1 - 9 represent the puzzle givens or clues. Any other non-blank character represents an unsolved cell.
The puzzle solving algorithm is home grown. I did not borrow any of the usual techniques from the literature, e.g. Donald Knuths "Dancing Links." Instead I rolled my own from scratch as a personal challenge. As such, its performance can only be blamed on yours truly. Still, I feel it is quite fast. On a 333 MHz Pentium II Linux box it solves typical medium force puzzles in approximately 800 microseconds or about 1,200 puzzles per second, give or take. On an Athlon XP 3000 it solves about 6,600 puzzles per sec. (Solving time is dependent upon degree of difficulty, so YMMV.)
Description of Algorithm:
The puzzle algorithm initially assumes every unsolved cell can assume every possible value. It then uses the placement of the givens to refine the choices available to each cell. I call this the markup phase.
After markup completes, the algorithm then looks for singleton cells with values that, due to constraints imposed by the row, column, or 3x3 region, may only assume one possible value. Once these cells are assigned values, the algorithm returns to the markup phase to apply these changes to the remaining candidate solutions. The markup/singleton phases alternate until either no more changes occur, or the puzzle is solved. I call the markup/singleton elimination loop the Simple Solver because in a large percentage of cases it solves the puzzle.
If the simple solver portion of the algorithm doesnt produce a solution, then more advanced deductive rules are applied.
Ive implemented two additional rules as part of the deductive puzzle solver. The first is subset elimination wherein a row/column/region is scanned for X number of cells with X number of matching candidate solutions. If such subsets (or tuples) are found in the row, column, or region, then the candidates values from the subset may be eliminated from all other unsolved cells within the row, column, or region, respectively.
The next deductive rule examines each region looking for candidate values that exclusively align themselves along a single row or column, i.e. a vector. If such candidate values are found, then they may be eliminated from the cells outside of the region that are part of the aligned row or column.
Note that each of the advanced deductive rules calls all preceeding rules, in order, if that advanced rule has effected a change in puzzle markup.
Finally, if no solution is found after iteratively applying all deductive rules, then we begin trial-and-error using recursion for backtracking. A working copy is created from our puzzle, and using this copy the first cell with the smallest number of candidate solutions is chosen. One of the solutions values is assigned to that cell, and the solver algorithm is called using this working copy as its starting point. Eventually, either a solution, or an impasse is reached.
If we reach an impasse, the recursion unwinds and the next trial solution is attempted. If a solution is found (at any point) the values for the solution are added to a list. Again, so long as we are examining all possibilities, the recursion unwinds so that the next trial may be attempted. It is in this manner that we enumerate puzzles with multiple solutions.
Note that it is certainly possible to add to the list of applied deductive rules. The techniques known as "X-Wing" and "Swordfish" come to mind. On the other hand, adding these additional rules will, in all likelihood, slow the solver down by adding to the computational burden while producing very few results. Ive seen the law of diminishing returns even in some of the existing rules, e.g. in subset elimination I only look at two and three valued subsets because taking it any further than that degraded performance.
Enhancements:
- Code optimization has resulted in a 30% increase in speed.