176 lines
5.3 KiB
Plaintext
176 lines
5.3 KiB
Plaintext
{
|
|
"cells": [
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"##### Copyright 2020 Google LLC."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"Licensed under the Apache License, Version 2.0 (the \"License\");\n",
|
|
"you may not use this file except in compliance with the License.\n",
|
|
"You may obtain a copy of the License at\n",
|
|
"\n",
|
|
" http://www.apache.org/licenses/LICENSE-2.0\n",
|
|
"\n",
|
|
"Unless required by applicable law or agreed to in writing, software\n",
|
|
"distributed under the License is distributed on an \"AS IS\" BASIS,\n",
|
|
"WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n",
|
|
"See the License for the specific language governing permissions and\n",
|
|
"limitations under the License.\n"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"# safe_cracking"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"<table align=\"left\">\n",
|
|
"<td>\n",
|
|
"<a href=\"https://colab.research.google.com/github/google/or-tools/blob/master/examples/notebook/contrib/safe_cracking.ipynb\"><img src=\"https://raw.githubusercontent.com/google/or-tools/master/tools/colab_32px.png\"/>Run in Google Colab</a>\n",
|
|
"</td>\n",
|
|
"<td>\n",
|
|
"<a href=\"https://github.com/google/or-tools/blob/master/examples/contrib/safe_cracking.py\"><img src=\"https://raw.githubusercontent.com/google/or-tools/master/tools/github_32px.png\"/>View source on GitHub</a>\n",
|
|
"</td>\n",
|
|
"</table>"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "markdown",
|
|
"metadata": {},
|
|
"source": [
|
|
"First, you must install [ortools](https://pypi.org/project/ortools/) package in this colab."
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {},
|
|
"outputs": [],
|
|
"source": [
|
|
"!pip install ortools"
|
|
]
|
|
},
|
|
{
|
|
"cell_type": "code",
|
|
"execution_count": null,
|
|
"metadata": {},
|
|
"outputs": [],
|
|
"source": [
|
|
"# Copyright 2010 Hakan Kjellerstrand hakank@gmail.com\n",
|
|
"#\n",
|
|
"# Licensed under the Apache License, Version 2.0 (the \"License\");\n",
|
|
"# you may not use this file except in compliance with the License.\n",
|
|
"# You may obtain a copy of the License at\n",
|
|
"#\n",
|
|
"# http://www.apache.org/licenses/LICENSE-2.0\n",
|
|
"#\n",
|
|
"# Unless required by applicable law or agreed to in writing, software\n",
|
|
"# distributed under the License is distributed on an \"AS IS\" BASIS,\n",
|
|
"# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n",
|
|
"# See the License for the specific language governing permissions and\n",
|
|
"# limitations under the License.\n",
|
|
"\"\"\"\n",
|
|
"\n",
|
|
" Safe cracking puzzle in Google CP Solver.\n",
|
|
"\n",
|
|
" From the Oz Primer:\n",
|
|
" http://www.comp.nus.edu.sg/~henz/projects/puzzles/digits/index.html\n",
|
|
" '''\n",
|
|
" The code of Professor Smart's safe is a sequence of 9 distinct\n",
|
|
" nonzero digits C1 .. C9 such that the following equations and\n",
|
|
" inequations are satisfied:\n",
|
|
"\n",
|
|
" C4 - C6 = C7\n",
|
|
" C1 * C2 * C3 = C8 + C9\n",
|
|
" C2 + C3 + C6 < C8\n",
|
|
" C9 < C8\n",
|
|
"\n",
|
|
" and\n",
|
|
"\n",
|
|
" C1 <> 1, C2 <> 2, ..., C9 <> 9\n",
|
|
"\n",
|
|
" can you find the correct combination?\n",
|
|
" '''\n",
|
|
"\n",
|
|
" Compare with the following models:\n",
|
|
" * MiniZinc: http://www.hakank.org/minizinc/safe_cracking.mzn\n",
|
|
" * ECLiPSe : http://www.hakank.org/eclipse/safe_cracking.ecl\n",
|
|
" * SICStus : http://www.hakank.org/sicstus/safe_cracking.pl\n",
|
|
" * Gecode: http://hakank.org/gecode/safe_cracking.cpp\n",
|
|
"\n",
|
|
" This model was created by Hakan Kjellerstrand (hakank@gmail.com)\n",
|
|
" Also see my other Google CP Solver models:\n",
|
|
" http://www.hakank.org/google_or_tools/\n",
|
|
"\"\"\"\n",
|
|
"from ortools.constraint_solver import pywrapcp\n",
|
|
"\n",
|
|
"\n",
|
|
"\n",
|
|
"# Create the solver.\n",
|
|
"solver = pywrapcp.Solver('Safe cracking puzzle')\n",
|
|
"\n",
|
|
"#\n",
|
|
"# data\n",
|
|
"#\n",
|
|
"n = 9\n",
|
|
"digits = list(range(1, n + 1))\n",
|
|
"\n",
|
|
"#\n",
|
|
"# variables\n",
|
|
"#\n",
|
|
"\n",
|
|
"LD = [solver.IntVar(digits, 'LD[%i]' % i) for i in range(n)]\n",
|
|
"C1, C2, C3, C4, C5, C6, C7, C8, C9 = LD\n",
|
|
"\n",
|
|
"#\n",
|
|
"# constraints\n",
|
|
"#\n",
|
|
"solver.Add(solver.AllDifferent(LD))\n",
|
|
"\n",
|
|
"solver.Add(C4 - C6 == C7)\n",
|
|
"solver.Add(C1 * C2 * C3 == C8 + C9)\n",
|
|
"solver.Add(C2 + C3 + C6 < C8)\n",
|
|
"solver.Add(C9 < C8)\n",
|
|
"for i in range(n):\n",
|
|
" solver.Add(LD[i] != i + 1)\n",
|
|
"\n",
|
|
"#\n",
|
|
"# search and result\n",
|
|
"#\n",
|
|
"db = solver.Phase(LD, solver.INT_VAR_DEFAULT, solver.INT_VALUE_DEFAULT)\n",
|
|
"\n",
|
|
"solver.NewSearch(db)\n",
|
|
"\n",
|
|
"num_solutions = 0\n",
|
|
"\n",
|
|
"while solver.NextSolution():\n",
|
|
" num_solutions += 1\n",
|
|
" print('LD:', [LD[i].Value() for i in range(n)])\n",
|
|
"\n",
|
|
"solver.EndSearch()\n",
|
|
"\n",
|
|
"print()\n",
|
|
"print('num_solutions:', num_solutions)\n",
|
|
"print('failures:', solver.Failures())\n",
|
|
"print('branches:', solver.Branches())\n",
|
|
"print('WallTime:', solver.WallTime(), 'ms')\n",
|
|
"\n"
|
|
]
|
|
}
|
|
],
|
|
"metadata": {},
|
|
"nbformat": 4,
|
|
"nbformat_minor": 4
|
|
}
|