Solve the no connection puzzle: Difference between revisions

Content added Content deleted

Inline

@@ Line 1: / Line 1: @@
 {{task|Puzzles}}
-You are given a box with eight holes labelled A-to-H, connected by fifteen
-straight lines in the pattern as shown
+You are given a box with eight holes labelled &nbsp; A-<small>to</small>-H, &nbsp; 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
+            / │ X │ \
-any line is greater than one.
+           /  │/ \│  \
+          '''C''' ─ '''D''' ─ '''E''' ─ '''F'''
+           \  │\ /│  /
+            \ │ X │ /
+             \│/ \│/
+              '''G'''   '''H'''
+You are also given eight pegs numbered &nbsp; 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:
+In this attempt:
+              '''4'''   '''7'''
+             /│\ /│\
+            / │ X │ \
+           /  │/ \│  \
+          '''8''' ─ '''1''' ─ '''6''' ─ '''2'''
+           \  │\ /│  /
+            \ │ X │ /
+             \│/ \│/
+              '''3'''   '''5'''
+Note that &nbsp; '''7''' &nbsp; and &nbsp; '''6''' &nbsp; are connected and have a difference of &nbsp; '''1''', &nbsp; so it is &nbsp; ''not'' &nbsp; a solution.
 ;Task
-Produce and show here ''one'' solution to the puzzle.
+Produce and show here &nbsp; ''one'' &nbsp; solution to the puzzle.
 ;Related tasks:
-* [[A* search algorithm]]
+:* &nbsp; [[A* search algorithm]]
-* [[Solve a Holy Knight's tour]]
+:* &nbsp; [[Solve a Holy Knight's tour]]
-* [[Knight's tour]]
+:* &nbsp; [[Knight's tour]]
-* [[N-queens problem]]
+:* &nbsp; [[N-queens problem]]
-* [[Solve a Hidato puzzle]]
+:* &nbsp; [[Solve a Hidato puzzle]]
-* [[Solve a Holy Knight's tour]]
+:* &nbsp; [[Solve a Holy Knight's tour]]
-* [[Solve a Hopido puzzle]]
+:* &nbsp; [[Solve a Hopido puzzle]]
-* [[Solve a Numbrix puzzle]]
+:* &nbsp; [[Solve a Numbrix puzzle]]
-* [[4-rings or 4-squares puzzle]]
+:* &nbsp; [[4-rings or 4-squares puzzle]]