Database System Concepts
7th Edition
ISBN: 9780078022159
Author: Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher: McGraw-Hill Education
expand_more
expand_more
format_list_bulleted
Related questions
Concept explainers
Question
Solve using integer
![# Integer Programming: Sudoku
# We have provided most of an IP implementation.
# Again, you just need to implement the constraints. Note however, unlike in the CSP version,
# we have not already "prefilled" the squares for you. You'll need to add those constraints yourself.
A helper function to visualize ouput. You do not need to change this ***
""" binary: the output of your solver ***
""" psize: the problem size (e.g. 3 for a 3x3 grid of 3x3 squares in a standard Sudoku) ***
def sudokuIPToGrid(binary,psize):
if binary is None:
return None
dim = psize**2
x = np.zeros((dim,dim),dtype=int)
for i in range (dim):
for j in range (dim):
for k in range(dim):
return x
if binary[dim*i+j][k] >= 0.99:
x[i][j] = k+1
*** Implementation for a IP Sudoku Solver ***
positions: list of (row,column, value) triples representing the already filled in cells"""
""" psize: the problem size (e.g. 3 for a 3x3 grid of 3x3 squares in a standard Sudoku) ***
"*" the library does not support 3D variables, so M[i][j] should be your indicator variable ***
""" for the ith square having value j where in a 4x4 grid i ranges from 0 to 15 ***
def sudokuIP (positions, psize):
# Define the variables - see comment above about interpretation
dim = psize**2
M = cp.Variable((dim**2,dim),integer=True) #Sadly we cannot do 3D Variables
print(positions)
constraints = []
#
# Your code
# It should define the constraints needed
# We've given you one to get you started
constraints.extend([0 <= M[x][k] for x in range(dim**2) for k in range (dim)])
constraints.extend([1 >= M[x][k] for x in range(dim**2) for k in range (dim)])
# End your code
#
# Form dummy objective - we only care about feasibility
obj = cp.Minimize (M[0][0])
# Form and solve problem.
prob = cp.Problem(obj, constraints)
prob.solve()
#Uncomment the version below instead if you want more detailed information from the solver to see what
might be going wrong
#Please leave commented out when submitting.
#prob.solve(verbose=True)
#For debugging you may want to look at some of the information contained in prob before returning
# See the example file
return M.value](https://content.bartleby.com/qna-images/question/96eb680b-bf96-4b4b-a2da-be1777b93ea0/d8127be3-9f02-4636-be99-991c56213337/7yfl256_processed.png)
Transcribed Image Text:# Integer Programming: Sudoku
# We have provided most of an IP implementation.
# Again, you just need to implement the constraints. Note however, unlike in the CSP version,
# we have not already "prefilled" the squares for you. You'll need to add those constraints yourself.
A helper function to visualize ouput. You do not need to change this ***
""" binary: the output of your solver ***
""" psize: the problem size (e.g. 3 for a 3x3 grid of 3x3 squares in a standard Sudoku) ***
def sudokuIPToGrid(binary,psize):
if binary is None:
return None
dim = psize**2
x = np.zeros((dim,dim),dtype=int)
for i in range (dim):
for j in range (dim):
for k in range(dim):
return x
if binary[dim*i+j][k] >= 0.99:
x[i][j] = k+1
*** Implementation for a IP Sudoku Solver ***
positions: list of (row,column, value) triples representing the already filled in cells"""
""" psize: the problem size (e.g. 3 for a 3x3 grid of 3x3 squares in a standard Sudoku) ***
"*" the library does not support 3D variables, so M[i][j] should be your indicator variable ***
""" for the ith square having value j where in a 4x4 grid i ranges from 0 to 15 ***
def sudokuIP (positions, psize):
# Define the variables - see comment above about interpretation
dim = psize**2
M = cp.Variable((dim**2,dim),integer=True) #Sadly we cannot do 3D Variables
print(positions)
constraints = []
#
# Your code
# It should define the constraints needed
# We've given you one to get you started
constraints.extend([0 <= M[x][k] for x in range(dim**2) for k in range (dim)])
constraints.extend([1 >= M[x][k] for x in range(dim**2) for k in range (dim)])
# End your code
#
# Form dummy objective - we only care about feasibility
obj = cp.Minimize (M[0][0])
# Form and solve problem.
prob = cp.Problem(obj, constraints)
prob.solve()
#Uncomment the version below instead if you want more detailed information from the solver to see what
might be going wrong
#Please leave commented out when submitting.
#prob.solve(verbose=True)
#For debugging you may want to look at some of the information contained in prob before returning
# See the example file
return M.value
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by stepSolved in 3 steps with 1 images
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Factor to obtain a product of sums: ../ (042) K'M'N + KL'N' + K'MN' + LN (four terms)arrow_forwardThe Lagrange polynomial that passes through the 3 data points is given by x 15 18 22 y 24 37 25 f2(x)=L0(x)(24)+L1(x)(37)+L2(x)(25) The Value of L1(x) at x = 16 is ???arrow_forwardusing python code determine the coeffcients of polynomial y=a0+a1x+a2x2+a3x3 that passes through the points (0,10),(1,35),(3,31), and (4,2)arrow_forward
- Using python, Compute and plot the first and second numerical derivative for 100 different values of x between (-10, 10).arrow_forwardUse Euler's Theorem to find a number a between 0 and 9 such that a is congruent to 7 1000 modulo 10. (Note that this is the same as the last digit of the decimal expansion of 7 1000.)arrow_forwardHow can you tell if a solution of equations has either no solution, one solution, or an infinite number of solutions using Gaussian elimination?arrow_forward
- Determine whether the following equation represents y as a function of x. 6xy = 12 function O not a functionarrow_forwardSimplify the following expressions in normal form, if one exists: (λq. q q)(λs. s s a)arrow_forwardusing equation method for Hamming code of (7,4),determine of the Following messages m1 = 1111 & %3D m2=1010 (solution by Hamming codes)arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON 
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education