Free rush hour puzzle solver software for linux

Java Sudoku is a cross platform version of the popular Sudoku logic game. Java Sudoku features an advanced user interface that is both easy to use and appealing to the eye.
It allows you to generate completely random Sudoku puzzles, enter your own puzzles from newspapers and magazines, or load them from Sudoku XML files. Java Sudoku can also be used as a Sudoku generator and solver.
Main features:
- Random puzzles every time you play
- Helping lines mode in the option menu, so You can see easier, if there is a collision
- 2 different systems of selecting cells and entering numbers
- 3 difficulty levels and an user custom level
- 3 Different Numbers Distributions
- Load/Save Sudoku games without any kind of losses
- Design your own puzzles - Under construction

Multiplication Puzzle project is a simple GTK+ 2 game that emulates the multiplication game found in Emacs.

Basically, a multiplication problem is shown with all digits replaced by letters. Your job is to guess which letter represents which number.

Translations are available for Afrikaans, Basque, Brazilian Portuguese, Chinese (simplified), French, German, Italian, Japanese, Kinyarwanda, Rhaeto-Romance, Romanian, Serbian, Turkish, and Vietnamese. If you are interested in helping to translate Multiplication Puzzle, please see the Translation Project, under the textual domain gmult.

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.

Sepp is a version of the classic sliding puzzle game in which the properly ordered tiles form a picture.
Sepp, the Sliding Evil-Piece Puzzle, implements a computer version of the classic moving puzzle game, which has 15 sliding tiles in a 4-by-4 matrix and is also known as the 15 puzzle, in which the properly ordered tiles would form a picture.
Variants like Loyds would be unsuitable for this version of the game because a picture in which two contiguous tiles were swapped (and which, therefore, could not be recomposed) might annoy users and likely be perceived as a bug in the program; therefore, Sepp does not perform arbitrary tile swapping when scrambling the tiles, and the original image can always be obtained given enough tile pushes.
On the other hand, Sepp implements its own innovative kind of player aggravation: based on a user-configurable degree of evil, ranging from Not at all evil to beyond Very Evil, Sepp decides, during each animation frame, whether it will disturb a tile while the game is in progress. For better or worse, this feature, which can be disabled by setting the evilness to Not at all evil, sets Sepp apart from other, similar games.
Main features:
- Sepp allows the player to select the tile that will be used as the empty slot by simply clicking on it before scrambling the tiles; this setting is remembered by Sepp for as long as the players session stays in the puzzle in which the tile was chosen, and is dismissed when the user chooses a different picture or different grid geometry.
- Sepp keeps track of time spent by the player in solving the puzzle, but displays it only if and when the puzzle is solved; in this regard, Sepp implements the same behavior as the casual game Frozen Bubble and avoids distracting and terrorizing the user during gameplay.
- The terror that Sepp does cause its players comes in four levels, and can be set using an options menu that is available with a single click immediately after startup; in consideration of the elderly, the children, and small household appliances, "evilness" is disabled by default.
- The Sepp player can enjoy endless hours the aggravation using the input device of his choice, whether it be the keyboard or the mouse: except for empty slot selection, all operations can be performed with either; additionally, Sepp does not require dragging of the tiles but instead supports single-click action.