Port sudoku-solver from java to python

Author: krishnangovindraj

sudoku/sample/sudoku1.txt

@@ -0,0 +1,6 @@
+0 0 3 6 0 0
+0 2 0 0 0 4
+5 0 0 0 6 0
+0 3 0 0 0 5
+3 0 0 0 1 0
+0 0 1 4 0 0

sudoku/sample/sudoku2.txt

@@ -0,0 +1,6 @@
+0 0 3 0 1 0
+5 6 0 3 2 0
+0 5 4 2 0 3
+2 0 6 4 5 0
+0 1 2 0 4 5
+0 4 0 1 0 0

sudoku/sample/sudoku3.txt

@@ -0,0 +1,6 @@
+0 0 6 0 0 0
+0 0 0 1 0 0
+0 0 2 0 4 1
+0 5 0 0 6 0
+6 4 0 0 0 0
+0 0 1 0 0 0

sudoku/sample/sudoku4.txt

@@ -0,0 +1,6 @@
+0 0 3 0 1 0
+5 6 0 3 2 0
+0 5 4 2 0 3
+2 0 6 4 5 0
+0 1 2 0 4 5
+0 4 0 1 0 0

sudoku/solve.py

@@ -0,0 +1,103 @@
+import math
+import timeit
+from sys import argv
+from typing import List
+
+from typedb.client import TypeDB, TypeDBClient, TypeDBOptions, SessionType, TransactionType
+
+
+HOST = TypeDB.DEFAULT_ADDRESS
+DATABASE_NAME = "sudoku6x6"
+QUERY_TEMPLATE = """
+match
+    $connector-hack = -1 isa connector-hack;
+    {0}
+    (
+        {1}
+    ) isa solution;
+limit 1;
+    """
+
+def format_sudoku(sudoku: List[List[int]]):
+    return "\n".join(" ".join(map(str, row)) for row in sudoku)
+
+def database_exists(client: TypeDBClient, db_name: str):
+    return client.databases().contains(db_name)
+
+def setup(client: TypeDBClient, db_name: str):
+    if database_exists(client, db_name):
+        client.databases().get(db_name).delete()
+    client.databases().create(db_name)
+
+    with open("sudoku6x6_schema.tql") as f:
+        schema = f.read()
+
+    with client.session(db_name, SessionType.SCHEMA) as session:
+        with session.transaction(TransactionType.WRITE) as tx:
+            tx.query().define(schema)
+            tx.commit()
+
+    with open("sudoku6x6_data.tql") as f:
+        data = f.read()
+
+    with client.session(db_name, SessionType.DATA) as session:
+        with session.transaction(TransactionType.WRITE) as tx:
+            tx.query().insert(data)
+            tx.commit()
+
+def solve(client: TypeDBClient, db_name: str, sudoku: List[List[int]]):
+    # create_query
+    non_zero = [(i,j,v) for i,row in enumerate(sudoku, 1) for j,v in enumerate(row, 1) if v != 0]
+    value_assignments = ["$v%d%d = %d isa number; $v%d%d != $connector-hack;"%(i,j,v,i,j) for (i,j,v) in non_zero]
+    role_players = [ ["pos%d%d: $v%d%d"%(i,j,i,j) for j in range(1,7)] for i in range(1,7) ]
+
+    query = QUERY_TEMPLATE.format(
+        "\n    ".join(value_assignments),
+        ",\n        ".join(", ".join(rp) for rp in role_players)
+    )
+
+    with client.session(db_name, SessionType.DATA) as session:
+        with session.transaction(TransactionType.READ, TypeDBOptions().set_infer(True)) as tx:
+            result = list(tx.query().match(query))
+
+    if result:
+        return [ [result[0].get("v%d%d"%(i,j)).get_value() for j in range(1,7)] for i in range(1,7) ]
+    else:
+        return None
+
+
+
+def main():
+    if len(argv) != 2:
+        print("Usage:")
+        print("python3 %s setup:            Loads required schema & data" % argv[0])
+        print("python3 %s <sudoku_file>:    Reads & solves the sudoku in <sudoku_file>" % argv[0])
+
+    client = TypeDB.core_client(HOST)
+    if argv[1] == "setup":
+        print("Setting up in database: '%s'..." % DATABASE_NAME)
+        setup(client, DATABASE_NAME)
+        return
+    if not database_exists(client, DATABASE_NAME):
+        print("Database '%s' does not exist. Setting up..." % DATABASE_NAME)
+        setup(client, DATABASE_NAME)
+
+    with open(argv[1]) as sudoku_file:
+        sudoku = [list(map(int, row.split())) for row in sudoku_file if row.strip()]
+
+    assert len(sudoku) == 6 and all(len(row)==6 for row in sudoku)
+
+    print("Solving:")
+    print(format_sudoku(sudoku), "\n")
+
+    time_start = timeit.default_timer()
+    solution = solve(client, DATABASE_NAME, sudoku)
+    time_taken_ms = math.ceil((timeit.default_timer() - time_start) * 1000)
+    if solution:
+        print("Found solution in " + str(time_taken_ms) + " ms:")
+        print(format_sudoku(solution))
+    else:
+        print("No solution (took " + str(time_taken_ms) + " ms)")
+
+
+if __name__=="__main__": main()

sudoku/sudoku6x6_data.tql

@@ -0,0 +1,30 @@
+#
+# Copyright (C) 2022 Vaticle
+#
+# Licensed to the Apache Software Foundation (ASF) under one
+# or more contributor license agreements.  See the NOTICE file
+# distributed with this work for additional information
+# regarding copyright ownership.  The ASF licenses this file
+# to you under the Apache License, Version 2.0 (the
+# "License"); you may not use this file except in compliance
+# with the License.  You may obtain a copy of the License at
+#
+#   http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing,
+# software distributed under the License is distributed on an
+# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+# KIND, either express or implied.  See the License for the
+# specific language governing permissions and limitations
+# under the License.
+#
+
+insert
+$connector-hack = -1 isa connector-hack;
+$v1 = 1 isa number;
+$v2 = 2 isa number;
+$v3 = 3 isa number;
+$v4 = 4 isa number;
+$v5 = 5 isa number;
+$v6 = 6 isa number;
+(mem: $v1, mem: $v2, mem: $v3, mem: $v4, mem: $v5, mem: $v6) isa permutation;

sudoku/sudoku6x6_schema.tql

@@ -0,0 +1,87 @@
+#
+# Copyright (C) 2022 Vaticle
+#
+# Licensed to the Apache Software Foundation (ASF) under one
+# or more contributor license agreements.  See the NOTICE file
+# distributed with this work for additional information
+# regarding copyright ownership.  The ASF licenses this file
+# to you under the Apache License, Version 2.0 (the
+# "License"); you may not use this file except in compliance
+# with the License.  You may obtain a copy of the License at
+#
+#   http://www.apache.org/licenses/LICENSE-2.0
+#
+# Unless required by applicable law or agreed to in writing,
+# software distributed under the License is distributed on an
+# "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+# KIND, either express or implied.  See the License for the
+# specific language governing permissions and limitations
+# under the License.
+#
+
+define
+
+# A temporary hack for the reasoner planner to consider all given values in a single retrievable.
+connector-hack sub attribute, value long;
+permutation sub relation, relates mem;
+permutation sub relation, relates mem;
+permutation sub relation, relates mem;
+
+number sub attribute, value long,
+    plays permutation:mem,
+    plays solution:pos11, plays solution:pos12, plays solution:pos13, plays solution:pos14, plays solution:pos15, plays solution:pos16,
+    plays solution:pos21, plays solution:pos22, plays solution:pos23, plays solution:pos24, plays solution:pos25, plays solution:pos26,
+    plays solution:pos31, plays solution:pos32, plays solution:pos33, plays solution:pos34, plays solution:pos35, plays solution:pos36,
+    plays solution:pos41, plays solution:pos42, plays solution:pos43, plays solution:pos44, plays solution:pos45, plays solution:pos46,
+    plays solution:pos51, plays solution:pos52, plays solution:pos53, plays solution:pos54, plays solution:pos55, plays solution:pos56,
+    plays solution:pos61, plays solution:pos62, plays solution:pos63, plays solution:pos64, plays solution:pos65, plays solution:pos66;
+
+solution sub relation,
+    relates pos11, relates pos12, relates pos13, relates pos14, relates pos15, relates pos16,
+    relates pos21, relates pos22, relates pos23, relates pos24, relates pos25, relates pos26,
+    relates pos31, relates pos32, relates pos33, relates pos34, relates pos35, relates pos36,
+    relates pos41, relates pos42, relates pos43, relates pos44, relates pos45, relates pos46,
+    relates pos51, relates pos52, relates pos53, relates pos54, relates pos55, relates pos56,
+    relates pos61, relates pos62, relates pos63, relates pos64, relates pos65, relates pos66;
+
+
+# These rules always fail, but makes each of them "concludable" and we hit the the reasoner instead of traversal
+rule dummy-triggers-reasoner:
+when {
+    $v = -1 isa number;
+} then {
+   (mem: $v, mem: $v, mem: $v, mem: $v, mem: $v, mem: $v) isa permutation;
+};
+
+rule solution-rule:
+when {
+    (mem: $a1, mem: $b1, mem: $c1, mem: $d1, mem: $e1, mem: $f1) isa permutation;
+    (mem: $a2, mem: $b2, mem: $c2, mem: $d2, mem: $e2, mem: $f2) isa permutation;
+    (mem: $a3, mem: $b3, mem: $c3, mem: $d3, mem: $e3, mem: $f3) isa permutation;
+    (mem: $a4, mem: $b4, mem: $c4, mem: $d4, mem: $e4, mem: $f4) isa permutation;
+    (mem: $a5, mem: $b5, mem: $c5, mem: $d5, mem: $e5, mem: $f5) isa permutation;
+    (mem: $a6, mem: $b6, mem: $c6, mem: $d6, mem: $e6, mem: $f6) isa permutation;
+
+    (mem: $a1, mem: $a2, mem: $a3, mem: $a4, mem: $a5, mem: $a6) isa permutation;
+    (mem: $b1, mem: $b2, mem: $b3, mem: $b4, mem: $b5, mem: $b6) isa permutation;
+    (mem: $c1, mem: $c2, mem: $c3, mem: $c4, mem: $c5, mem: $c6) isa permutation;
+    (mem: $d1, mem: $d2, mem: $d3, mem: $d4, mem: $d5, mem: $d6) isa permutation;
+    (mem: $e1, mem: $e2, mem: $e3, mem: $e4, mem: $e5, mem: $e6) isa permutation;
+    (mem: $f1, mem: $f2, mem: $f3, mem: $f4, mem: $f5, mem: $f6) isa permutation;
+
+    (mem: $a1, mem: $b1, mem: $c1, mem: $a2, mem: $b2, mem: $c2) isa permutation;
+    (mem: $a3, mem: $b3, mem: $c3, mem: $a4, mem: $b4, mem: $c4) isa permutation;
+    (mem: $a5, mem: $b5, mem: $c5, mem: $a6, mem: $b6, mem: $c6) isa permutation;
+    (mem: $d1, mem: $e1, mem: $f1, mem: $d2, mem: $e2, mem: $f2) isa permutation;
+    (mem: $d3, mem: $e3, mem: $f3, mem: $d4, mem: $e4, mem: $f4) isa permutation;
+    (mem: $d5, mem: $e5, mem: $f5, mem: $d6, mem: $e6, mem: $f6) isa permutation;
+} then {
+    (
+    pos11: $a1, pos12: $b1, pos13: $c1, pos14: $d1, pos15: $e1, pos16: $f1,
+    pos21: $a2, pos22: $b2, pos23: $c2, pos24: $d2, pos25: $e2, pos26: $f2,
+    pos31: $a3, pos32: $b3, pos33: $c3, pos34: $d3, pos35: $e3, pos36: $f3,
+    pos41: $a4, pos42: $b4, pos43: $c4, pos44: $d4, pos45: $e4, pos46: $f4,
+    pos51: $a5, pos52: $b5, pos53: $c5, pos54: $d5, pos55: $e5, pos56: $f5,
+    pos61: $a6, pos62: $b6, pos63: $c6, pos64: $d6, pos65: $e6, pos66: $f6
+    ) isa solution;
+};