Free sudoku software for linux

YasSS is a command line C++ program that solves given Sudokus.
The actual work is done in a class the encapsulates all the functionality, so it should be easy to set up another GUI for it.
How It Works
YasSS stores the Sudoku field in a two-dimensional array. For each cell there is stored which numbers can be entered there.
The actual solver is discussed below.
Header File of Class Sudoku
If a cell contains a zero, it is empty.
#ifndef _MORITZ_FIELD_
#define _MORITZ_FIELD_
#include < iostream >
// a Sudoku playing field implemented as a 2d fixed size array
// contains consistency checks and a solver.
class sudoku {
public:
sudoku();
// creates a field with in ital data. 0 means "not set".
// Note that the first coordinate is considered as x, so if
// you create an array char f= {{1 ,2 ...}, {..}} you will get
// the transposed sudoku field. but dont worry, sudoku is
// invariant under transposition
sudoku(char init_data[9][9]);
sudoku(char* init_data);
// creates a field with initial data. 0 means "not set".
// Note that the first coordinate is considered as x, so if
// you create an array char f= {{1 ,2 ...}, {..}} you will get
// the transposed sudoku field. but dont worry, sudoku is
// invariant under transposition
sudoku(int init_data[9][9]);
// generates a rather simplistic output to the given stream
// call as pretty_print(cout) or something like that...
void pretty_print(std::ostream &handle);
// just print all chars in one row
void print(std::ostream &handle);
// sets item (x, y) to val
// assumes that it is doesnt lead to an intermediate
// conflict with sudoku rules
// which is equivalent to saying it requires
// allowed_set(val, x, y) to be true
void set_item(char val, int x, int y);
// get entry at position (x, y)
// 0 means "unset"
int get_item(int x, int y);
// returns true if it doesnt lead to a direct error if you
// set (x, y) to val
// If data[x][y] != 0 the return value is
// true if val == data[x][y]
bool allowed_set(char val, int x, int y);
// try to solve the puzzle. Returns true on success.
bool solve();
// returns true if there is no zero entry left, e.g. the
// problem is solved correctly.
bool is_solved();
// returns true if there is no possibility to continue without
// violating rule
bool is_stuck();
protected:
// contains 0 for unset values and the corresponding value
// if the value is set
char data[9][9];
// allowed[x][y][i] is true if and only if it is possible to
// set data[x][y] to i+1 without conjuring an immediate
// collision.
// If data[x][y] == i != 0 then allowed[x][y][i] is true,
// allowed[x][y][j] = false for j != i
bool allowed[9][9][9];
bool simple_solve();
bool simple_solve1();
bool simple_solve2();
// returns either an is_solved or a stuck() version of *this
bool backtrack();
void null_init();
int recursion_depth;
void set_recursion_depth(int rd) {recursion_depth = rd;};
};
Enhancements:
- This release adds an option to generate Sudokus with a random number of initial clues.

SuDoKuToon project is a fun Sudoku game with unique features for your desktop.

Sudoku Toon is a free version of the popular game "Sudoku" thinking for you to be able to play it directly from your desktop while you are in the office or in your break time.

The game consist in fill the grid of 9x9 with number from 1 to 9 in such way that in each line, column or subgrid of 3x3, the numbers are not repeated
Besides of have to fill the grids with numbers of 1 to 9, you will be able to change and choose to play with colors or geometric figures. The game counts with 3 original music that you will be able to turn on or off whenever you wish.

Sudoku Toon has funny graphics and hundreds of "sudokus" to solve at your disposition, and if your head is tired, you will be able to continue later because the game will save the state of a sudoku automatically... and finally, if you want more sudokus... you will be able to download more packs of sudokus to get more challenges!!

KSudoku project can generate and solve sudoku puzzles (of different difficulty level) using a randomized least-candidate algorithm.
The sudoku boards currently supported are 9x9 and 16x16: but the program is fully expandable since the algorithm is extendible to any general graph coloring problem (the board is in fact stored as a graph and the numbers are the colors)
In order to create a playable puzzle it fills a blank sudoku grid with a completed puzzle (randomly), then another algorithm (to be improved with some logical constraint) removes randomly numbers from it checking each time that the resultant puzzle has only one solution: it is a bit slower than logic-based elimination tecniques but it creates puzzles that are less straight-solved (more fun).
The GUI is user-friendly and requires KDE. Written in C++.
INSTALLATION
1. Open a shell in project directory (the one where this file is located)
2. Run "./configure"
(will install the program in /usr/local/kde, if you want to install in /usr run "./configure --prefix=/usr")
3. Run "make"
4. Run "make install" as root.
5. Run "ksudoku" (if does not start check point 2)
Enhancements:
- Added support for custom shaped sudokus
- Samurai sudoku
- Jigsaw sudoku, XSudoku, 4x4
- Undo/redo
- Added new export system (you can print multiple puzzles in the same page)
- File format is now XML
- Added new welcomescreen and settings dialog
- Internal structure changed

sudoku solver by darsie project is a console-based sudoku solver.

sudoku solver by darsie is a console program that reads data from stdin (typically redirected from a file) and prints a possibly partial result. Definitive numbers are printed all over their fields.

Other fields contain the numbers that are not yet excluded.

Three solving rules are implemented and most sudokus are solved in a few milliseconds.

Usage:
sudoku<<less