Free jumble puzzle solver software for linux

Scrabble Blast Solver 0.1 offers you a professional and easy-to-use software which is an effective way to find and display words and their score for the popular online Scrabble Blast game. This product will be your good choice.

Sudoku solver application was created for solving a Sudoku with a backtracking algorithm. Instead of using a 9 x 9 matrix, it extends the matrix to 10 x 36 (10 rows, 36 columns), storing information in the extra cells.

The last row is used for keeping track of how many cells, for the current column, are still available.

The columns 9-17 (0-based) are used for storing the numbers which are still available in rows 0-8.

The columns 18-26 are used for storing the numbers which are still available in columns 0-8.

The columns 27-35 are used for storing the numbers which are still available in each square (counting from left to right and from top to bottom).

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.

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.

15 pieces (also known as 16 pieces) puzzle game where you have to arrange pieces in order from 1-15 counting from top left corner to bottom right corner.

15 pieces puzzle is a SuperKaramba theme.

Jumble project is a class level mutation testing tool that works in conjunction with JUnit. The purpose of mutation testing is to provide a measure of the effectiveness of test cases.
A single mutation is performed on the code to be tested, the corresponding test cases are then executed. If the modified code fails the tests, then this increases confidence in the tests. Conversely, if the modified code passes the tests this indicates a testing deficiency.
Example:
Here is some example Jumble output for a Java class called "Foo", which has some JUnit tests in a class called "FooTest".
Jumble starts by running the unit tests (in FooTest.class) on the unmodified Foo class to check that they all pass, and to measure the time taken by each test. Then it will mutate Foo in various ways and run the tests again to see if they detect the mutation. It continues this process until all mutations of Foo have been tried. The output might look like this:
Mutating Foo
Tests: FooTest
Mutation points = 12, unit test time limit 2.02s
..
M FAIL: Foo:31: negated conditional
M FAIL: Foo:33: negated conditional
M FAIL: Foo:34: - -> +
M FAIL: Foo:35: negated conditional
......
Score: 67%
This says that Jumble has tried 12 different mutants of Foo and the unit tests (in FooTest) correctly detected the changed behaviour in 8/12 cases (indicated by a .), but failed to detect the change in the other 4/12 cases. For example, when an if (C) decision on line 31 was mutated to if (!C), the unit tests still passed, so they are probably not testing that if statement thoroughly enough.
Overall, 67% of the mutations were detected by the unit tests, which means that they probably need to be improved.
Enhancements:
- This is the first public release, though Jumble has been used on a daily basis within ReelTwo.com for several years.