Sudoku is a game played on a 9×9 grid. The goal of the game is to fill all cells of the grid with digits from 1 to 9, so that each column, each row, and each of the nine 3×3 sub-grids (also known as blocks) contain all of the digits from 1 to 9.
(More info at: http://en.wikipedia.org/wiki/Sudoku)

Sudoku Solution Validator

Write a function validSolution/ValidateSolution/valid_solution() that accepts a 2D array representing a Sudoku board, and returns true if it is a valid solution, or false otherwise. The cells of the sudoku board may also contain 0’s, which will represent empty cells. Boards containing one or more zeroes are considered to be invalid solutions.

The board is always 9 cells by 9 cells, and every cell only contains integers from 0 to 9.

Examples

validSolution([
  [5, 3, 4, 6, 7, 8, 9, 1, 2],
  [6, 7, 2, 1, 9, 5, 3, 4, 8],
  [1, 9, 8, 3, 4, 2, 5, 6, 7],
  [8, 5, 9, 7, 6, 1, 4, 2, 3],
  [4, 2, 6, 8, 5, 3, 7, 9, 1],
  [7, 1, 3, 9, 2, 4, 8, 5, 6],
  [9, 6, 1, 5, 3, 7, 2, 8, 4],
  [2, 8, 7, 4, 1, 9, 6, 3, 5],
  [3, 4, 5, 2, 8, 6, 1, 7, 9]
]); // => true

validSolution([
  [5, 3, 4, 6, 7, 8, 9, 1, 2], 
  [6, 7, 2, 1, 9, 0, 3, 4, 8],
  [1, 0, 0, 3, 4, 2, 5, 6, 0],
  [8, 5, 9, 7, 6, 1, 0, 2, 0],
  [4, 2, 6, 8, 5, 3, 7, 9, 1],
  [7, 1, 3, 9, 2, 4, 8, 5, 6],
  [9, 0, 1, 5, 3, 7, 2, 1, 4],
  [2, 8, 7, 4, 1, 9, 6, 3, 5],
  [3, 0, 0, 4, 8, 1, 1, 7, 9]
]); // => false

Solution

#include <stdbool.h>

bool validSolution(unsigned int board[9][9])
{
  /* Write your code here */
  int b, k, ko, bb, kk, jum, cek = 1;

  for (b = 0; b < 9; b++)
  {
    jum = 0;
    for (k = 0; k < 9; k++)
    {
      jum = jum + board[b][k];
    }
    if (jum != 45)
    {
      cek = 0;
    }
  }

  for (b = 0; b < 9; b++)
  {
    jum = 0;
    for (k = 0; k < 9; k++)
    {
      jum = jum + board[k][b];
    }
    if (jum != 45)
    {
      cek = 0;
    }
  }

  for (ko = 0; ko < 9; ko++)
  {
    bb = (ko / 3) * 3;
    kk = (ko % 3) * 3;
    jum = 0;
    for (b = bb; b < bb + 3; b++)
    {
      for (k = kk; k < kk + 3; k++)
      {
        jum = jum + board[b][k];
      }
    }
    if (jum != 45)
    {
      cek = 0;
    }
  }
  return cek;
}

The post Belajar Bahasa C – Sudoku Solution Validator appeared first on Onestring Lab.

Sudoku adalah salah satu jenis puzzle atau permainan angka yang sangat populer. Tua dan muda memainkan permainan ini untuk mengisi waktu luang mereka atau untuk mengasah otak mereka dengan mudah. Meski merupakan game jadul, hingga kini penggemar sudoku terus bermunculan dan berkembang.

Sudoku, awalnya disebut Number Place, adalah teka-teki penempatan nomor kombinatorial berbasis logika. Dalam Sudoku klasik, tujuannya adalah untuk mengisi kisi 9 × 9 dengan angka sehingga setiap kolom, baris, dan masing-masing dari sembilan subkisi 3 × 3 yang membentuk kisi (juga disebut kotak, blok, atau wilayah) adalah semua berisi angka 1 sampai 9.

Bila Anda belum mengetahui konsep dasar dari bahasa pemrograman Python silahkan kunjungin artikel Konsep Dasar Python.

Kode Program

import numpy as np

def possible(y, x, n):
    global grid
    for i in range (0,9):
        if grid[y][i] == n :
            return False
    for i in range(0,9):
        if grid[i][x] == n :
            return False
    x0 = (x//3)*3
    y0 = (y//3)*3
    for i in range (0,3):
        for j in range (0,3):
            if grid[y0+i][x0+j] == n :
                return False
    return True

def solve() :
    global grid
    for y in range (9) :
        for x in range (9) :
            if grid[y][x] == 0 :
                for n in range(1,10) :
                    if possible (y,x,n) :
                        grid[y][x] = n
                        solve()
                        grid[y][x] = 0
                return
    print(np.matrix(grid))

grid = [
        [7, 8, 0, 4, 0, 0, 1, 2, 0],
        [6, 0, 0, 0, 7, 5, 0, 0, 9],
        [0, 0, 0, 6, 0, 1, 0, 7, 8],
        [0, 0, 7, 0, 4, 0, 2, 6, 0],
        [0, 0, 1, 0, 5, 0, 9, 3, 0],
        [9, 0, 4, 0, 6, 0, 0, 0, 5],
        [0, 7, 0, 3, 0, 0, 0, 1, 2],
        [1, 2, 0, 0, 0, 7, 4, 0, 0],
        [0, 4, 9, 2, 0, 6, 0, 0, 7]
    ]


print('Puzzle:')
print(np.matrix(grid))
print('Solve:')
solve()

Keluaran Program

Puzzle:
[[7 8 0 4 0 0 1 2 0]
 [6 0 0 0 7 5 0 0 9]
 [0 0 0 6 0 1 0 7 8]
 [0 0 7 0 4 0 2 6 0]
 [0 0 1 0 5 0 9 3 0]
 [9 0 4 0 6 0 0 0 5]
 [0 7 0 3 0 0 0 1 2]
 [1 2 0 0 0 7 4 0 0]
 [0 4 9 2 0 6 0 0 7]]
Solve:
[[7 8 5 4 3 9 1 2 6]
 [6 1 2 8 7 5 3 4 9]
 [4 9 3 6 2 1 5 7 8]
 [8 5 7 9 4 3 2 6 1]
 [2 6 1 7 5 8 9 3 4]
 [9 3 4 1 6 2 7 8 5]
 [5 7 8 3 9 4 6 1 2]
 [1 2 6 5 8 7 4 9 3]
 [3 4 9 2 1 6 8 5 7]]

Kesimpulan

Problem puzzle Sudoku diselesaikan dengan algoritma rekursif. Untuk artikel lain terkait dengan pemrograman Python silahkan lihat kumpulan artikelnya disini.

The post Belajar Python – Menyelesaikan Sudoku dengan Python appeared first on Onestring Lab.