Free sudoku downloads for windows software for linux

Downloader for X is a tool for downloading files from the Internet via both HTTP and FTP with a powerful but userfriendly interface.
Downloader for X supports reconnecting and resuming on connection timeouts, has a download queue for multiple files, support for simultaneous downloads, and many other features for powerful downloading.
Main features:
- Supporting both FTP and HTTP protocols as well as HTTP and FTP proxy servers. SOCKS5 support is also included! Authentication on the proxy servers is supported too.
- The Program keep the logs of all download sessions that allows advanced user to monitor problems manualy according information from these logs.
- It allows users to manage their downloads in real time. User can pause, continue, move in queue, add new downloads and remove downloads manualy. User also can allow to remove completed or failed downloads automatically by the program.
- Recursive downloading via FTP as well as via HTTP is supported. Powerful Filters-manager allow advanced user to specify files which must to be downloaded and files which must to be skipped. Wildcards are supported for FTP downloads too.
- Ability to download in more than one connection per time. Usualy downloading using number of connections increases speed of downloading up to 300% and even more!
- Supporting of so called `Persistent connections increases speed of downloading due much less amount of `standing connection stages. With this feature D4X uses connections to the servers many times. Persistent connections over HTTP are supported automaticaly but persistent connections over FTP can be turned on by user (Do not send QUIT command option of FTP settings).
- Ability to limit download speed of separate file as well as for the whole program allows modem user browse through the Web and download files at the same time.
- Built-in Scheduller, URL-manager and Automatically adding allow advaced user to simplify managing downloads by various criterias.
- Multiqueued design, ability to run without X interface, ability to manage D4X via command line and many other features will satisfy anybody who find a time to learn this program.
Enhancements:
- bug fixes

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.

Downloads in Tab is an extension which opens "Downloads" manager in tab from Tools menu.

Opens "Downloads" manager in tab from Tools menu or automaticlly when a download starts, when in options you uncheck "Show the Downloads window when downloading a file"

To use tab, in Firefox Options dialog uncheck "Show the Downloads window when downloading a file"

To use window, in Firefox Options dialog check "Show the Downloads window when downloading a file"

To use neither, disable or remove this extension and in Firefox Options dialog uncheck "Show the Downloads window when downloading a file" which will restore original functioning.