示例#1
0
        static void Main()
        {
            grid = new InputService().GetInput();
            // TODO: optimise order of iteration --> maintain record of 'areas' that are well-populated somehow??

            //  grid.UpdateNeighbours(4,2);

            for (int i = 0; i < grid.GridSize; i++)
            {
                for (int j = 0; j < grid.GridSize; j++)
                {
                    if (grid.GetCell(i, j).Value != 0)
                    {
                        continue;
                    }

                    grid.GetCell(i, j).Options = grid.UpdateCellOptions(i, j, grid.GetCell(i, j).Square);
                }
            }


            while (grid.CompletedCells < (grid.GridSize * grid.GridSize))
            {
                // TODO::: UTMOST IMPORTANCE
                // important --> should be called in other locations also? After every update, on every cell --> or only on every dependent cell

                /*     for (int i = 0; i < grid.GridSize; i++)
                 *   {
                 *       for (int j = 0; j < grid.GridSize; j++)
                 *       {
                 *           Cell c = grid.GetCell(i, j);
                 *           // TODO: maintain simple list of unsolved cells
                 *           if (c.Value != 0)
                 *           {
                 *               continue;
                 *           }
                 *
                 *           c.Options = grid.UpdateCellOptions(i, j, c.Square);
                 *           if (c.Options.Count <= 1)
                 *           {
                 *               grid.GetCell(i, j).Value = c.Options[0];
                 *               grid.GetCell(i, j).Options.Clear();
                 *               grid.CompletedCells++;
                 *               Console.WriteLine("Solved a number: [{0},{1}], value = {2}", i, j, c.Value);
                 *           }
                 *       }
                 *   }*/

                //NEXT STEPS: implement http://www.conceptispuzzles.com/index.aspx?uri=puzzle/sudoku/techniques

                grid.SearchRowForSingleCandidates();
                grid.SearchColumnForSingleCandidates();
                grid.SearchSquareForSingleCandidates();


//                for (int i = 0; i < grid.GridSize; i++)
//                {
//                    for (int j = 0; j < grid.GridSize; j++)
//                    {
//                        Console.Write(grid.GetCell(i, j).Value + " ");
//                    }
//                    Console.WriteLine();
//                }
//                Console.WriteLine();
            }

            Console.WriteLine(grid.IsValidSolution());

            // The completed grid!!
            for (int i = 0; i < grid.GridSize; i++)
            {
                for (int j = 0; j < grid.GridSize; j++)
                {
                    Console.Write(grid.GetCell(i, j).Value + " ");
                }
                Console.WriteLine();
            }

            Console.WriteLine("DONE");

            Console.ReadKey();
        }