This is where Connor messes around with some mini projects. These projects are normally very short and using Pygame for demonstration (click to start).
Here is the list of current mini-projects:
-
Sudoku cracker (backtrack algorithm)
Sudoku is a logic-based, combinatorial number-placement puzzle. The objective is to fill a 9×9 grid with digits so that each column, each row, and each of the nine 3×3 subgrids that compose the grid (also called "boxes", "blocks", or "regions") contain all of the digits from 1 to 9. The puzzle setter provides a partially completed grid, which for a well-posed puzzle has a single solution. (Wikipedia)
Let your computer help you on your next sudoku challenge night!
-
N Queens Puzzle (local search)
Originally known as Eight queens Puzzle. The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requires that no two queens share the same row, column, or diagonal. The eight queens puzzle is an example of the more general n queens problem of placing n non-attacking queens on an n×n chessboard, for which solutions exist for all natural numbers n with the exception of n = 2 and n = 3. (Wikipedia)
-
Percolation Simulator (Node)
We model a percolation system using an n-by-n grid of sites. Each site is either open or blocked. A full site is an open site that can be connected to an open site in the top row via a chain of neighboring (left, right, up, down) open sites. We say the system percolates if there is a full site in the bottom row. In other words, a system percolates if we fill all open sites connected to the top row and that process fills some open site on the bottom row.
-
Patterns (Just a game)
For each column and row, the numbers indicates the patterns of continuous blocks. The position of blocks have to satisfy both conditions from rows and columns. Click the board to place the block. If one condition is satisfied, the label will turn purple.