b027e57e95
- Currently not implemented... Add abseil patch - Add patches/absl-config.cmake Makefile: Add abseil-cpp on unix - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake Makefile: Add abseil-cpp on windows - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake CMake: Add abseil-cpp - Force abseil-cpp SHA1 to 45221cc note: Just before the PR #136 which break all CMake port to absl: C++ Part - Fix warning with the use of ABSL_MUST_USE_RESULT > The macro must appear as the very first part of a function declaration or definition: ... Note: past advice was to place the macro after the argument list. src: dependencies/sources/abseil-cpp-master/absl/base/attributes.h:418 - Rename enum after windows clash - Remove non compact table constraints - Change index type from int64 to int in routing library - Fix file_nonport compilation on windows - Fix another naming conflict with windows (NO_ERROR is a macro) - Cleanup hash containers; work on sat internals - Add optional_boolean sub-proto Sync cpp examples with internal code - reenable issue173 after reducing number of loops port to absl: Python Part - Add back cp_model.INT32_MIN|MAX for examples Update Python examples - Add random_tsp.py - Run words_square example - Run magic_square in python tests port to absl: Java Part - Fix compilation of the new routing parameters in java - Protect some code from SWIG parsing Update Java Examples port to absl: .Net Part Update .Net examples work on sat internals; Add C++ CP-SAT CpModelBuilder API; update sample code and recipes to use the new API; sync with internal code Remove VS 2015 in Appveyor-CI - abseil-cpp does not support VS 2015... improve tables upgrade C++ sat examples to use the new API; work on sat internals update license dates rewrite jobshop_ft06_distance.py to use the CP-SAT solver rename last example revert last commit more work on SAT internals fix
114 lines
2.7 KiB
Python
114 lines
2.7 KiB
Python
# Copyright 2010 Hakan Kjellerstrand hakank@gmail.com
|
|
#
|
|
# Licensed 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.
|
|
"""
|
|
|
|
Magic squares in Google CP Solver.
|
|
|
|
Magic square problem.
|
|
|
|
This model was created by Hakan Kjellerstrand (hakank@gmail.com)
|
|
Also see my other Google CP Solver models:
|
|
http://www.hakank.org/google_or_tools/
|
|
"""
|
|
from __future__ import print_function
|
|
import sys
|
|
from ortools.constraint_solver import pywrapcp
|
|
|
|
|
|
def main(n, limit):
|
|
# Create the solver.
|
|
solver = pywrapcp.Solver("n-queens")
|
|
|
|
#
|
|
# data
|
|
#
|
|
|
|
#
|
|
# declare variables
|
|
#
|
|
x = {}
|
|
for i in range(n):
|
|
for j in range(n):
|
|
x[(i, j)] = solver.IntVar(1, n * n, "x(%i,%i)" % (i, j))
|
|
x_flat = [x[(i, j)] for i in range(n) for j in range(n)]
|
|
|
|
# the sum
|
|
# s = ( n * (n*n + 1)) / 2
|
|
s = solver.IntVar(1, n * n * n, "s")
|
|
|
|
#
|
|
# constraints
|
|
#
|
|
# solver.Add(s == ( n * (n*n + 1)) / 2)
|
|
|
|
solver.Add(solver.AllDifferent(x_flat))
|
|
|
|
[solver.Add(solver.Sum([x[(i, j)] for j in range(n)]) == s) for i in range(n)]
|
|
[solver.Add(solver.Sum([x[(i, j)] for i in range(n)]) == s) for j in range(n)]
|
|
|
|
solver.Add(solver.Sum([x[(i, i)] for i in range(n)]) == s) # diag 1
|
|
solver.Add(solver.Sum([x[(i, n - i - 1)] for i in range(n)]) == s) # diag 2
|
|
|
|
# symmetry breaking
|
|
# solver.Add(x[(0,0)] == 1)
|
|
|
|
#
|
|
# solution and search
|
|
#
|
|
solution = solver.Assignment()
|
|
solution.Add(x_flat)
|
|
solution.Add(s)
|
|
|
|
# db: DecisionBuilder
|
|
db = solver.Phase(
|
|
x_flat,
|
|
# solver.INT_VAR_DEFAULT,
|
|
solver.CHOOSE_FIRST_UNBOUND,
|
|
# solver.CHOOSE_MIN_SIZE_LOWEST_MAX,
|
|
|
|
# solver.ASSIGN_MIN_VALUE
|
|
solver.ASSIGN_CENTER_VALUE)
|
|
|
|
solver.NewSearch(db)
|
|
num_solutions = 0
|
|
while solver.NextSolution():
|
|
print("s:", s.Value())
|
|
for i in range(n):
|
|
for j in range(n):
|
|
print("%2i" % x[(i, j)].Value(), end=" ")
|
|
print()
|
|
|
|
print()
|
|
num_solutions += 1
|
|
if num_solutions > limit:
|
|
break
|
|
solver.EndSearch()
|
|
|
|
print()
|
|
print("num_solutions:", num_solutions)
|
|
print("failures:", solver.Failures())
|
|
print("branches:", solver.Branches())
|
|
print("WallTime:", solver.WallTime())
|
|
|
|
|
|
n = 4
|
|
limit=100
|
|
if __name__ == "__main__":
|
|
if len(sys.argv) > 1:
|
|
n = int(sys.argv[1])
|
|
if len(sys.argv) > 2:
|
|
limit = int(sys.argv[2])
|
|
|
|
main(n, limit)
|