Hex Turn Puzzles

Link to Japanese version
00:00
R-Click:OFF
mute:OFF
Cell Size:
40px
30px
20px

[Rule]

Find a path that visits each sign(except "●") exactly once according to the following rule.

  1. Your path can only turn gently (or go straight) on a "○".
  2. Your path can only turn sharply (or go straight) in an "△".
  3. Your path can turn freely (or go straight) in an "◎".
  4. Your can not go into an "●".
  5. You must start from "S" if "S" is on the board and must end at "G" if "G" is on the board.
  6. If "S" is not on the board, you must make the single loop.

[Operation]

  1. Left click -> draw a path or restore a erased path, Shift + Left click or Right click -> erase a path
  2. Paths you can not pass through are automatically erased.
  3. "Back" -> 1 step back, "Restart" -> Restart from the scratch, "Save" -> Save the current status, "Restore" -> Restore the saved data.

番号 17
出題日 2014-03-15
レベル 2
正解 (表示

一覧表示へ

トップページへ戻る