[HaBo]

void fillGrid(data, grid){
	x = -1
	for(i=0; i<81; i++){
		if((i%9) == 0) 
			x++
		grid[x%9][i%9] = data[i]
	}
}

boolean solve(row, col, grid){
	if(row == 9){   
		row = 0
	    if(col++ == 9)
	    	return true
	}           
	   
	if(grid[row][col] > 0)  
		return solve(row+1, col, grid);
	               
	for(x=1; x<10; x++) {
		if(check(row, col, x, grid)) { 
			grid[row][col] = x;       
	        if(solve(row+1, col, grid))
	        	return true
		}
	}

	grid[row][col] = 0;
	return false;
}

boolean check(row, col, x, grid){
	for(k=0; k<9; k++)
		if(x == grid[k][col])
			return false
		
	for(k=0; k<9; k++)
		if(x == grid[row][k])
			return false
	
	rowOffset = (int)(row/3)*3
	colOffset = (int)(col/3)*3
	for(k=0; k<3; k++)
	    for(m=0; m<3; m++)
			if(x == grid[rowOffset+k][colOffset+m])
				return false
	
	return true;
}

void printGrid(grid){
	for(row in grid)
		println row
	println ""
}

void doIt(){
	grid = new int[9][9]
	data = [ 0,0,0,0,0,0,0,0,0, 0,7,0,0,4,0,0,1,0, 3,0,1,5,0,6,4,0,8,
	         0,0,0,0,0,0,0,0,0, 0,6,0,0,1,0,0,4,0, 1,0,5,7,0,9,8,0,3,
	         0,0,0,0,0,0,0,0,0, 0,3,0,0,7,0,0,2,0, 2,0,4,8,0,5,7,0,9 ]
	
	fillGrid(data, grid)
	printGrid(grid)
	if(solve(0, 0, grid))
		printGrid(grid)
	else
		println "Keine Lösung"
}

// startet die anwendung
doIt()

boolean solve(row, col, grid){
	if(row == 9){   
		row = 0            //hier fehlt eins
	    if(col++ == 9)
	    	return true    //hier auch
	}           
}