55 lines
1.6 KiB
Text
55 lines
1.6 KiB
Text
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'''
|
|
|
|
You are also given eight pegs numbered 1-<small>to</small>-8.
|
|
|
|
|
|
;Objective:
|
|
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:
|
|
In this attempt:
|
|
|
|
'''4''' '''7'''
|
|
/│\ /│\
|
|
/ │ X │ \
|
|
/ │/ \│ \
|
|
'''8''' ─ '''1''' ─ '''6''' ─ '''2'''
|
|
\ │\ /│ /
|
|
\ │ X │ /
|
|
\│/ \│/
|
|
'''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]]
|
|
|
|
|
|
|
|
;See also
|
|
[https://www.youtube.com/watch?v=AECElyEyZBQ No Connection Puzzle] (youtube).
|
|
<br><br>
|