Anonymous user
Solve the no connection puzzle: Difference between revisions
m
added whitespace and highlighting, minimized the word "to", added two section header (;Objective: and ;Example:), used better glyphs for the two diagrams,
m (added whitespace and highlighting, minimized the word "to", added two section header (;Objective: and ;Example:), used better glyphs for the two diagrams,) |
|||
Line 1:
{{task|Puzzles}}
You are given a box with eight holes labelled A-to-H, connected by fifteen▼
▲You are given a box with eight holes labelled A-<small>to</small>-H, connected by fifteen straight lines in the pattern as shown below:
'''A''' '''B'''▼
/|\ /|\▼
/ | X | \▼
/ |/ \| \▼
'''C''' - '''D''' - '''E''' - '''F'''▼
\ |\ /| /▼
\ | X | /▼
\|/ \|/▼
'''G''' '''H'''▼
▲ '''A''' '''B'''
You are also given eight pegs numbered 1-to-8. The idea is to place the pegs in▼
the holes so that the (absolute) difference between any two numbers connected by▼
▲ '''G''' '''H'''
▲You are also given eight pegs numbered 1-<small>to</small>-8.
For example, in this attempt:▼
'''4''' '''7'''▼
/|\ /|\▼
/ | X | \▼
/ |/ \| \▼
'''8''' - '''1''' - '''6''' - '''2'''▼
\ |\ /| /▼
\ | X | /▼
\|/ \|/▼
'''3''' '''5'''▼
;Objective:
Note that 7 and 6 are connected and have a difference of 1 so it is ''not'' a solution.▼
▲Place the eight pegs in the holes so that the (absolute) difference between any two numbers connected by any line is <u>greater</u> than one.
;Example:
▲ '''4''' '''7'''
▲ '''3''' '''5'''
▲Note that '''7''' and '''6''' are connected and have a difference of '''1''', so it is ''not'' a solution.
;Task
Produce and show here ''one'' solution to the puzzle.
;Related tasks:
:* [[A* search algorithm]]
:* [[Solve a Holy Knight's tour]]
:* [[Knight's tour]]
:* [[N-queens problem]]
:* [[Solve a Hidato puzzle]]
:* [[Solve a Holy Knight's tour]]
:* [[Solve a Hopido puzzle]]
:* [[Solve a Numbrix puzzle]]
:* [[4-rings or 4-squares puzzle]]
| |||