Difference between revisions of "Source Code"
From Krupczak.org
(→Java Sudoku Puzzle Solver) |
|||
| Line 1: | Line 1: | ||
== Java Sudoku Puzzle Solver == | == Java Sudoku Puzzle Solver == | ||
| − | I wrote a Java program to solve Sudoku puzzles. It uses a recursive brute-force algorithm to try all possible combinations. | + | I wrote a [[Java program Image:SudokuPuzzle.java]] to solve Sudoku puzzles. It uses a recursive brute-force algorithm to try all possible combinations. |
I wrote a Java/Swing GUI front end for my Java Sudoku puzzle solver. Its currently fairly crude. | I wrote a Java/Swing GUI front end for my Java Sudoku puzzle solver. Its currently fairly crude. | ||
| − | |||
| − | |||
== Concentric Circles Layout == | == Concentric Circles Layout == | ||
I wrote this Java/Swing class, for use in conjunction with the [http://www.jpgrah.org JGraph] toolkit, to layout vertices in concentric circles. Nodes are placed within concentric circles based on the number of edges they connect to -- most to least are placed inner to outer. | I wrote this Java/Swing class, for use in conjunction with the [http://www.jpgrah.org JGraph] toolkit, to layout vertices in concentric circles. Nodes are placed within concentric circles based on the number of edges they connect to -- most to least are placed inner to outer. | ||
Revision as of 10:47, 21 July 2008
Java Sudoku Puzzle Solver
I wrote a Java program Image:SudokuPuzzle.java to solve Sudoku puzzles. It uses a recursive brute-force algorithm to try all possible combinations.
I wrote a Java/Swing GUI front end for my Java Sudoku puzzle solver. Its currently fairly crude.
Concentric Circles Layout
I wrote this Java/Swing class, for use in conjunction with the JGraph toolkit, to layout vertices in concentric circles. Nodes are placed within concentric circles based on the number of edges they connect to -- most to least are placed inner to outer.
