Combinatorics & Algorithm Traditional Instance Insanity Cube Puzzle Discussion

User Generated

Enpury_B

Programming

Description

Hi,

I need step-by-step solutions for the question in the attached word file. It based on Introduction to Algorithms 3rd Edition (2009) by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein ("CLRS").

Please bid only if you understand algorithms well and can solve the Instant Insanity problem completely

Further context for the question-

For Instant Insanity (it's a well known problem, not specific to this class), blocks must be arranged on top of each other in one stack/column with each side showing each color exactly once. In other words, from each direction you face the stack, you should see a column in which no color repeats and every color is represented. If there is no solution, a "minimum obstacle set" can be identified which is a representative smallest set of cubes which are not compatible with the original set (it means no matter how you stack the cubes, there’s will potentially be at least two sides where the colors are the same. A “half solution” may not have all the colors, but at least there are no collisions. For more background on Instant Insanity here is a computer program written for this course previously that covers it: https://github.com/SMikaelian/MATH482-InstantInsan...

Thanks :)

Unformatted Attachment Preview

Combinatorics Work 1 1. Traditional Instant Insanity. Directions: If the puzzle has a solution, circles the opposite pairs needed for one of the required half solutions, and draw squares around the opposite pairs needed for the complementary half solution. If there is no solution, prove it! Proving doesn’t mean using a computer program to make an exhaustive check. Finally, if there is no solution, provide a minimum obstacle, namely, a smallest subset of these cubes that cannot be stacked without collision. Cube 1: o-r g-p b-p Cube 2: b-b g-y r-y Cube 3: o-y g-r b-y Cube 4: b-p g-p o-r Cube 5: o-y r-y o-o Cube 6: o-o p-p p-p
Purchase answer to see full attachment
User generated content is uploaded by users for the purposes of learning and should be used following Studypool's honor code & terms of service.

Explanation & Answer

Attached. Please let me know if you have any questions or need revisions.

TRADITIONAL INSTANCES INSANITIES

Programming
Student Name
Institutional Affiliation

TRADITIONAL INSTANCES INSANITIES

The puzzle does not have a solution. A solvable puzzle does not have any repeating colors on
one side of the stack. Cube 6 has every two of its sides colored the same color and cube 5 having
three of its side colored orange. With the other four cubes having at least one of its faces colore...


Anonymous
Great! Studypool always delivers quality work.

Studypool
4.7
Trustpilot
4.5
Sitejabber
4.4

Similar Content

Related Tags