Free sudoku for windows mobile 6 software for linux

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.

Sudoku Sensei project is a sudoku "explainer" C/C++ library with sample programs.
It can list the logical steps taken. It can generate new Sudokus and rank their difficulty. It supports not only 9x9 grids, but MxN, samurai, or any layout you can describe.
The core is a C/C++ library.
It includes sample programs.
Enhancements:
- This release adds a Graphical User Interface with a manual and a tutorial.

Sudoku Savant is a simple GUI-driven application to solve and generate Sudoku puzzles through logical means.

Sudoku Savant generates and solves standard Sudoku puzzles with anything from 3x3 to 5x6 or 6x5 grids, using the following strategies:

- Singletons
- Locked candidates
- Number subsets
- X-Wings, Swordfish and Jellyfish
- Both Simple and Multi-Colouring.

These strategies should be enough to provide a step by step solution for any Sudoku puzzle that you are likely to find in a newspaper or magazine, although Savant can also resort to "trial and error" if presented with something really pathologically nasty. (This will at least confirm that the puzzles solution is unique.)

You may also parameterise or turn off the more advanced strategies, to see whether they were really needed.

Finally, Sudoku Savant lets you solve the puzzle by hand, providing hints, cell colouring, up to 4 pencil marks per cell, and the ability to high-light any incorrect moves. A partially completed puzzle can be saved in a simple text format so that you can continue solving it later.

Linux Mobile System project (LMS) is a full Linux system whose support is the new USB Flash Memory Drives. The intention is to boot any PC with USB support with our system and therefore we will have every administration and analysis applications that we have selected, so we will not need install it. This way, always we will be able to get our Linux system ready to use in our pocket.
This project arose with the intention to study the Linux system of exhaustive way and simultaneously enjoy with it. The initial idea is to fuse two separated disciplines: the programming and the systems management. So well center our study in the denominated "system programming, as much networking level as at device level (drivers).
Main features:
- To initiate our Linux system from memories flash USB.
- The system will be a selection of common GNU tools in every system: disk diagnosis, memory, hardware, networks monitoring tools, etc.
- LMS Tux
- As far as possible well develop new tools and/or utilities with the objective to study deeply the underlying technology.
- The programming languages used will be C, C++, Python and Perl, without forget the system shell scripts.
- The resources minimization (disk space, memory...) isnt a functional objective of the developments.
LMSs main aim is to achieve a highly specialized distribution of GNU/Linux which can carried through the USB Flash Memory Drives. Once the distribution is ready in the USB device, it can be carried in your own pocket and you can start up any PC x86 with no need to install it directly in the PC.
The LMS system is aimed at the development of specific tasks such as network administration, security analysis of networks, and recovery and repair of host data, as well as all information exchange, which is what makes it different from other portable systems such as "live CDs". The main idea is to carry all the potency of Linux and our tools in our own pockets, ready to be used.

Funambol is open source mobile application server software that provides push email, address book and calendar (PIM) data synchronization, application provisioning, and device management for wireless devices and PCs, leveraging standard protocols. For users, this means BlackBerry-like capabilities on commodity handsets.
This project is also a software development platform for mobile applications. It provides client and server side Java APIs, and facilitates the development, deployment and management of any mobile project. Funambol is the de facto standard implementation of the Open Mobile Alliance Data Synchronization and Device Management protocols (OMA DS and DM, formerly known as SyncML).
Main features:
- Funambol Data Synchronization Server: a mobile application server providing synchronization services for wireless clients and PCs, including push email.
- Funambol Device Management: an OMA DM server to remotely manage mobile devices.
- Funambol Connectors: gateways to file systems, databases, email systems, and applications for two-way synchronization with existing data assets.
- Funambol Client Plug-ins: protocol extenders and clients for Outlook, Windows Mobile, BlackBerry, Palm and iPod so users can synchronize their email messages and PIM data (address book, calendar, tasks and notes) with the server.
- Funambol Software Development Kit: tools to develop sometimes-connected mobile applications on devices (in Java - J2SE and J2ME - and C++) and to add data sources to the server.
Enhancements:
- Major feature enhancements