The Big Programming Thread - Page 400

     for row = 0 to 9
         for column = 0 to 9
             if grid[row][column] is 0
                 grid[row][column] = 1

                 currentValue = grid[row][column]

                 while (!checkGrid) // the whole grid is validated
                      if currentValue < 9
                          grid[row][column]++
                          currentValue++
                      else
                          // this is to see if 9 is ok to be there
                          if (checkGrid)
                              break
                          else
                              // if not, then dead end
                              grid[row][column] = 0
                          
                              // if the previous cell is not on the same row
                              if (column is 0)
                                  column = 8
                                  row = row - 1
                              else 
                                   column = column - 1
                                   // the place I get stuck?

                                   // reset the previous cell's value to 0 
                                   // so the next iteration detects it as empty
                                   grid[row][column = 0

                                   // subtract column again because of 'for' loop's iteration
                                   column = column - 1
 
                                   break
     return true (this is when all  loops end, so solution is found?)

grid[row][column]++
currentValue++

public SolveSudoku(Grid)
{
    if(tryToSolve(Grid))
        return;
    else
        throw new InvalidInputException()
}

private boolean checkGrid(Grid)
{
   if(sudokuconditions)  
       return true;
   else
       return false;
}

private int getNextOpenPosition(Grid)
{
    //find position, if grid is full return -1
}

private boolean tryToSolve(Grid)
{  
    int currentPosition = getNextOpenPosition(Grid) 
    if(currentPosition == -1)                        //grid is full
           return true;
    for(int i = 1; i < 10; i ++)
    {
          Grid[currentPosition] = i;
          if(checkGrid(Grid))                        //the number inserted does not break any rules
              if(tryToSolve(Grid))                //do the same for the next position on the grid
                   return true; //if the next position works, and consequently everything after that

                                         // else just keep the loop going and try the next number
    }
    return false;   //no numbers work, return false (means a previous number was wrong)
}

int[][] board = new int[9][9];

main {
  initialize preset values to 1-9. all other cells should be set to 0
  if (solve(0)) {
    //solution is now stored in board.
  }
}

boolean solve(int cell) {
  if (cell > 80) return true;
  int row = cell/9;
  int col = cell%9;
  if board[row][col] != 0 return solve(cell+1);
  for (int i = 1; i < 10; i++) {
    if (okToPlace(i,row,col)) {
      board[row][col] = i;
      if (solve(cell+1)) return true;
      board[row][col] = 0;
    }
  }
  return false;
}

boolean okToPlace(int i, int row, int col) {
  return true if placing i in board[row][col] is legal with regards to all existing values
  else return false
}

<html>
<div id="boxgrp1">
<input type = checkbox>
<input type = checkbox>
</div>
</html>

javascript (not sure if this is the correct syntax/correct methods to call, but something similar should be possible.)

var children = document.getElementById('boxgrp1').childNodes;
for(int i = 0; i < children.length; i++)
{
     var theCheckbox = children[i];
     //do whatever you wanted to do
}

<input type="checkbox" name="set1" id="q1" value="1" /><label for="q1">My question 1</label> 
<input type="checkbox" name="set1" id="q2" value="1" /><label for="q2">My question 2</label>