|
| 1 | +package cub.jvm |
| 2 | + |
| 3 | +// Just a simple class with some computations |
| 4 | +class BacktrackingSudokuSolver { |
| 5 | + |
| 6 | + fun printBoard() { |
| 7 | + board.forEach { row -> |
| 8 | + row.forEach { print("$it ") } |
| 9 | + println() |
| 10 | + } |
| 11 | + } |
| 12 | + |
| 13 | + fun solve(): Boolean { |
| 14 | + board.forEachIndexed { i, row -> |
| 15 | + row.forEachIndexed { j, column -> |
| 16 | + if (board[i][j] == NO_VALUE) { |
| 17 | + for (k in MIN_VALUE..MAX_VALUE) { |
| 18 | + board[i][j] = k |
| 19 | + if (isValid(i, j) && solve()) { |
| 20 | + return true |
| 21 | + } |
| 22 | + board[i][j] = NO_VALUE |
| 23 | + } |
| 24 | + return false |
| 25 | + } |
| 26 | + } |
| 27 | + } |
| 28 | + return true |
| 29 | + } |
| 30 | + |
| 31 | + private fun isValid(row: Int, column: Int): Boolean { |
| 32 | + return rowConstraint(row) && |
| 33 | + columnConstraint(column) && |
| 34 | + subsectionConstraint(row, column) |
| 35 | + } |
| 36 | + |
| 37 | + private fun subsectionConstraint(row: Int, column: Int): Boolean { |
| 38 | + val constraint = BooleanArray(BOARD_SIZE) |
| 39 | + val subsectionRowStart = row / SUBSECTION_SIZE * SUBSECTION_SIZE |
| 40 | + val subsectionRowEnd = subsectionRowStart + SUBSECTION_SIZE |
| 41 | + val subsectionColumnStart = column / SUBSECTION_SIZE * SUBSECTION_SIZE |
| 42 | + val subsectionColumnEnd = subsectionColumnStart + SUBSECTION_SIZE |
| 43 | + for (r in subsectionRowStart until subsectionRowEnd) { |
| 44 | + for (c in subsectionColumnStart until subsectionColumnEnd) { |
| 45 | + if (!checkConstraint(r, constraint, c)) return false |
| 46 | + } |
| 47 | + } |
| 48 | + return true |
| 49 | + } |
| 50 | + |
| 51 | + private fun columnConstraint(column: Int): Boolean { |
| 52 | + val constraint = BooleanArray(BOARD_SIZE) |
| 53 | + return (BOARD_START_INDEX until BOARD_SIZE).all { checkConstraint(it, constraint, column) } |
| 54 | + } |
| 55 | + |
| 56 | + private fun rowConstraint(row: Int): Boolean { |
| 57 | + val constraint = BooleanArray(BOARD_SIZE) |
| 58 | + return (BOARD_START_INDEX until BOARD_SIZE).all { checkConstraint(row, constraint, it) } |
| 59 | + } |
| 60 | + |
| 61 | + private fun checkConstraint(row: Int, constraint: BooleanArray, column: Int): Boolean { |
| 62 | + if (board[row][column] != NO_VALUE) { |
| 63 | + if (!constraint[board[row][column] - 1]) { |
| 64 | + constraint[board[row][column] - 1] = true |
| 65 | + } else { |
| 66 | + return false |
| 67 | + } |
| 68 | + } |
| 69 | + return true |
| 70 | + } |
| 71 | + |
| 72 | + companion object { |
| 73 | + private const val BOARD_SIZE = 9 |
| 74 | + private const val SUBSECTION_SIZE = 3 |
| 75 | + private const val BOARD_START_INDEX = 0 |
| 76 | + private const val NO_VALUE = 0 |
| 77 | + private const val MIN_VALUE = 1 |
| 78 | + private const val MAX_VALUE = 9 |
| 79 | + private val board = arrayOf( |
| 80 | + intArrayOf(8, 0, 0, 0, 0, 0, 0, 0, 0), |
| 81 | + intArrayOf(0, 0, 3, 6, 0, 0, 0, 0, 0), |
| 82 | + intArrayOf(0, 7, 0, 0, 9, 0, 2, 0, 0), |
| 83 | + intArrayOf(0, 5, 0, 0, 0, 7, 0, 0, 0), |
| 84 | + intArrayOf(0, 0, 0, 0, 4, 5, 7, 0, 0), |
| 85 | + intArrayOf(0, 0, 0, 1, 0, 0, 0, 3, 0), |
| 86 | + intArrayOf(0, 0, 1, 0, 0, 0, 0, 6, 8), |
| 87 | + intArrayOf(0, 0, 8, 5, 0, 0, 0, 1, 0), |
| 88 | + intArrayOf(0, 9, 0, 0, 0, 0, 4, 0, 0) |
| 89 | + ) |
| 90 | + } |
| 91 | +} |
0 commit comments