Sudoku Easy/Medium Solver Script 1.1

This is a small project aiming to prove a theory that grids can be solved using only the "possible value" method, whereby the numbers are filled in according the condition that that position has only one possible value, in filling this in, possible values matching this number on the same x and y axis, and "block" are removed, thus allowing space for more single possible value positions.This cycle is repeated until the grid is complete. The code project was a success in terms of proving part of the theory. This method can fill in very easy, or already half filled in grids.But in situations where there are no more positions with single possible values, this method fails. In a human player case, the player would simply observe that, for instance, an 8 can onlygo in the first column of a block because there are eights inother blocks in the other two columns, therefore the 8 must go in that column. This calls for a more intelligent approach to solving the grid in a future methodology. Amoung the checking for matching numbers present in the same x and y axis, and block (these methods are present in the below code project), there are variouse presentthods that an experienced player uses to solve a grid.

Requirements:	No special requirements
Platforms:	C and C plus plus
Keyword:	Block,  Blocks,  Column,  Eights,  Experienced,  Filled,  Inother,  Matching,  Method,  Numbers,  Player,  Present,  Project,  Single,  Sudoku Easymedium Solver Script 1 1,  Theory,  Values
Users rating:	0/10