Melon s Puzzle Packs

Similar documents
Melon s Puzzle Packs

IN THIS ISSUE

puzzles may not be published without written authorization

BmMT 2015 Puzzle Round November 7, 2015

Grade 6 Math Circles March 7/8, Magic and Latin Squares

We hope you enjoy the set. Good luck for the Indian Puzzle Championship! 3 A B C 4 H D 5 G F E 7 A B 8 H 9 G F

Colossal Cave Collection Sampler

Sudoku Xtra. Sudoku Xtra 1. >> The Logic Puzzle Brain Workout. Issue 8 - July Expanded Community Section! >> Samurai Sudoku 6x6: S

WPF PUZZLE GP 2018 ROUND 1 COMPETITION BOOKLET. Host Country: Turkey. Serkan Yürekli, Salih Alan, Fatih Kamer Anda, Murat Can Tonta A B H G A B I H

WPF PUZZLE GP 2014 COMPETITION BOOKLET ROUND 1 WPF SUDOKU/PUZZLE GRAND PRIX 2014

Dutch Sudoku Advent 1. Thermometers Sudoku (Arvid Baars)

IN THIS ISSUE. WPC Placement. WPC Placement Puzzles of the th Belarusian Puzzle Championship. Puzzles of the

Grade 7 & 8 Math Circles February 2-3, 2016 Logic Puzzles

WPF PUZZLE GP 2016 ROUND 8 INSTRUCTION BOOKLET. Host Country: Russia. Andrey Bogdanov. Special Notes: No special notes for this round.

LMI-MONTHLY TEST JUN 2010 'SPEED SIXES'

Kenken For Teachers. Tom Davis January 8, Abstract

UN DOS TREZ Sudoku Competition. Puzzle Booklet for Preliminary Round. 19-Feb :45PM 75 minutes

Name. Part 2. Part 2 Swimming 55 minutes

Part III F F J M. Name

WPF PUZZLE GP 2018 ROUND 4 COMPETITION BOOKLET. Host Country: Czech Republic

WPF PUZZLE GP 2018 ROUND 3 COMPETITION BOOKLET. Host Country: India + = 2 = = 18 = = = = = =

Swaroop Guggilam, Ashish Kumar, Rajesh Kumar, Rakesh Rai, Prasanna Seshadri

1. Use Pattern Blocks. Make the next 2 figures in each increasing pattern. a) 2. Write the pattern rule for each pattern in question 1.

WPF PUZZLE GP 2018 ROUND 7 INSTRUCTION BOOKLET. Host Country: Netherlands. Bram de Laat. Special Notes: None.

BEST PRACTICES COURSE WEEK 14 PART 2 Advanced Mouse Constraints and the Control Box

SUDOKU1 Challenge 2013 TWINS MADNESS

This chapter gives you everything you

15/03/23: BACA by John Bulten Theme: Beach Booty

Take Control of Sudoku

FEATURES 24 PUZZLES, ASSORTED MIX, MOSTLY THEMED ON 24 HPC. HINTS FOR EACH PUZZLE. SOLUTIONS FOR EACH PUZZLE.

ILLUSION CONFUSION! - MEASURING LINES -

Jamie Mulholland, Simon Fraser University

METHOD 1: METHOD 2: 4D METHOD 1: METHOD 2:

Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples

1. Hex Tapa (12 points) 2. Hex Dominos (13 points)

Preview Puzzle Instructions U.S. Sudoku Team Qualifying Test September 6, 2015

The 2017 British Informatics Olympiad

Square Roots and the Pythagorean Theorem

KenKen Strategies 17+

MATHEMATICS ON THE CHESSBOARD

Inductive Reasoning Practice Test. Solution Booklet. 1

INSTRUCTION BOOKLET SUDOKU MASTERS 2008 NATIONAL SUDOKU CHAMPIONSHIP FINALS Q&A SESSION 10:30 10:50 PART 1 CLASSICS 11:00 11:35

Instruction booklet EVOLVED TERRESTRIALS. 16th-17th April 2011

LMI Monthly Test May 2010 Instruction Booklet

NAME : SUDOKU MASTERS 2008 FINALS PART 1 CLASSICS. 1. Classic Sudoku Classic Sudoku Classic Sudoku 50

Dragnet Abstract Test 4 Solution Booklet

LMI SUDOKU TEST 7X JULY 2014 BY RICHARD STOLK

Welcome to the Sudoku and Kakuro Help File.

Instructions Booklet. 12th WSC INDIA 2017 LOGIC MASTERS INDIA. MONDAY, 16th OCTOBER Session 1. Session 2. TUESDAY, 17th OCTOBER Session 3.

WPF PUZZLE GP 2017 ROUND 5A COMPETITION BOOKLET. Host Country: Czech Republic C D. Author: Jan Novotný

1st UKPA Sudoku Championship

A B O U T T H E S E P U Z Z L E S

Inside Outside Circles Outside Circles Inside. Regions Circles Inside Regions Outside Regions. Outside Inside Regions Circles Inside Outside

n r for the number. (n r)!r!

A few chessboards pieces: 2 for each student, to play the role of knights.

Over ===* Three games of strategy and chance Unique solitaire puzzles. For I to 4 players Ages 12 to adult. PassTM

Episode 5 11 th 14 th May Casual & Word by Rakesh Rai

Grade 7/8 Math Circles. Mathematical Puzzles

WPF PUZZLE GP 2015 COMPETITION BOOKLET ROUND 7. Puzzle authors: Switzerland Roger Kohler Fred Stalder Markus Roth Esther Naef Carmen Günther

Year 5 Problems and Investigations Spring

GPLMS Revision Programme GRADE 6 Booklet

Original Recipe. Windy Days Quilt by Sarah Meyer

Special Geometry Exam, Fall 2008, W. Stephen Wilson. Mathematics Department, Johns Hopkins University

Logic Masters Instructions, First round

Shaftesbury Park Primary School. Wandsworth test examples

Indian Puzzle Championship 2013

Slitherlink. Supervisor: David Rydeheard. Date: 06/05/10. The University of Manchester. School of Computer Science. B.Sc.(Hons) Computer Science

CSE Day 2016 COMPUTE Exam. Time: You will have 50 minutes to answer as many of the problems as you want to.

Rounds: 2780 points 3 hours 45 minutes

Episode 3 16 th 19 th March Made In India and Regions by Prasanna Seshadri

Twenty-sixth Annual UNC Math Contest First Round Fall, 2017

1 Introduction. 2 An Easy Start. KenKen. Charlotte Teachers Institute, 2015

Name. WPC French Qualifier Part I

KenKen Strategies. Solution: To answer this, build the 6 6 table of values of the form ab 2 with a {1, 2, 3, 4, 5, 6}

MATH CIRCLE, 10/13/2018

The Pythagorean Theorem

Introduction to Counting and Probability

Chapter 4: Patterns and Relationships

BMT 2018 Combinatorics Test Solutions March 18, 2018

Tapa Variations Contest

Exploring Concepts with Cubes. A resource book

St Thomas of Canterbury Catholic Primary School Where every child is special

Sequential Dynamical System Game of Life

Once you get a solution draw it below, showing which three pennies you moved and where you moved them to. My Solution:

F F J M. Name. Part I

Cryptic Crosswords for Bright Sparks

Final Project: Reversi

Lecture 1, CS 2050, Intro Discrete Math for Computer Science

INSTRUCTION BOOKLET (v2)

Worksheet 10 Memorandum: Construction of Geometric Figures. Grade 9 Mathematics

Grade 6 Math Circles. Math Jeopardy

WPF PUZZLE GP 2016 ROUND 6 INSTRUCTION BOOKLET. Host Country: Serbia. Nikola Živanović, Čedomir Milanović, Branko Ćeranić

WPF PUZZLE GP 2015 INSTRUCTION BOOKLET ROUND 7. Puzzle authors: Switzerland Roger Kohler Fred Stalder Markus Roth Esther Naef Carmen Günther

Sudoku Mock Test 5. Instruction Booklet. 28 th December, IST (GMT ) 975 points + Time Bonus. Organized by. Logic Masters: India

Representing Square Numbers. Use materials to represent square numbers. A. Calculate the number of counters in this square array.

The 2009 British Informatics Olympiad

Downloaded from

IN THIS ISSUE. Cave vs. Pentagroups

Mathematics Revision Guides Loci Page 1 of 10 Author: Mark Kudlowski M.K. HOME TUITION. Mathematics Revision Guides. Level: GCSE Foundation Tier LOCI

Round minutes. Best results:

Transcription:

Melon s Puzzle Packs Volume I: Slitherlink By MellowMelon; http://mellowmelon.wordpress.com January, TABLE OF CONTENTS Tutorial : Classic Slitherlinks ( 5) : 6 Variation : All Threes (6 8) : 9 Variation : Interior Path (9 ) : Variation : Domino ( 4) : Variation 4: Relation (5 7) : Variation 5: Liar (8 ) : Chimera Slitherlinks ( ) : 4 Larger Slitherlinks (4 5) : 5 Hints : 7 Solutions : 9 Introduction This pack contains 5 Slitherlink puzzles, a little over half of which are variations of some kind. The puzzles span a wide range of difficulties from very accessible to fairly difficult. If you are new to Slitherlink or even logic puzzles in general, there is also a tutorial provided at the beginning to help bring you up to speed. Each puzzle has a certain number of melon icons at the top right indicating the difficulty as estimated by the author. The more melons, the harder the puzzle. But keep in mind that your experience may vary. If you are struggling with a puzzle, the Hints section provides a tip for each puzzle that may help, usually describing how to get past a sticking point near the start. Solutions are in the back if you get really stumped or want to check your work.

Melon s Puzzle Packs Vol. I: Slitherlink Page / Slitherlink Tutorial In Slitherlink, you are to draw a single closed loop of horizontal and vertical line segments between the dots. The loop may not touch or intersect itself. A number in a square tells how many of the four sides of the square are part of the loop. The solution will be unique. Below is a small example puzzle with its solution. A walkthrough for this example begins on page 4. One of the most appealing things about solving Slitherlink puzzles is the immense number of patterns and theorems that can be built from this very simple set of rules. Much of the process involved in solving Slitherlink puzzles is recognizing occurrences of these patterns and applying them to steadily build up the loop until it is completed. Below are very basic patterns to help you get started on thinking about what kinds of rules there are to be found. next to a next to a on edge One of the most basic patterns is a next to a, which allows you to figure out right away the location of the three segments around the. When a is on the edge of the puzzle, two of the dots become dead ends and can t be used at all. The extra X s this gets you allow you to determine the segments around a if it is on the edge and next to a.

Melon s Puzzle Packs Vol. I: Slitherlink Page / s touching diagonally Adjacent s The center dot between two diagonally touching s can have at most two segments on it, like any other dot. Since we need six segments in all around the s, the only way for the totals to work out is if the outside four segments are all part of the loop. in a corner with an X Again, the two middle dots can have at most two segments, so each one contributes at least one X to one of the s. Following this logic through fully gets all of the drawn segments and Xs. in a corner An extension of the pattern from before. If you have a boxed in a corner, whether through being on the edge of the puzzle or from two X s, you only need one more X around it todetermine its two segments. in a corner Similarly, if a is boxed in a corner, using the dot next to that corner requires two segments around the. So that dot is unusable and you can draw X s around it. As shown in the lower left, watch for ways to chain this pattern together. Cornered s When a is boxed in a corner, you have to use the dot next to that corner. This can often be combined with some patterns, like adjacent s, to fully determine the three segments. When a corner of the loop touches a at a point, you can determine the s segments immediately. As shown above, this pattern can sometimes be chained together.

Melon s Puzzle Packs Vol. I: Slitherlink Page 4/ Segment touching a Segment touching a If you have a segment next to a and it can t turn away, either because of being on the edge or because of an X, the segment around the is reduced to one of two positions. This allows you to draw in somexs. If a segment touches a, this immediately gives you two of its segments. You also get an X from the fact that a corner of the loop can t touch a at a point. Let s go over how we would solve the example puzzle from page using many of these ideas. To start, we can recognize some of the basic patterns with a next to a (top left) or a next to a (bottom left). After this, we can also find some s boxed into corners. In row column (RC), we have two Xs next to the top left dot from the. In RC4, the is bounded by the edge of the puzzle and an X. In R5C, the is actually in the corner of the puzzle. We can combine this with the adjacent s pattern observed before to solve most of the lower left corner. On the left, the has been finished, so we can draw an X and continue the segment across the left edge. In the top right, our new segments created a corner in one of the dots, and the Xs that gives us allow us to finish the on RC4.

Melon s Puzzle Packs Vol. I: Slitherlink Page 5/ The top left dot is a dead-end, so we can X the space below it. This allows us to finish the loop on the left edge and get some more Xs from dead-ends. In RC5, we have a in a corner with an X, so we can finish its segments. This also determines the below it. Finally, in the bottom, we have a segment next to a, allowing us to apply that pattern. From here the puzzle can be straightforwardly finished by continuing the segments around the RC clue, which are nearly trapped by the Xs we ve drawn. Here are some additional tips for solving Slitherlinks. Avoid the temptation to guess when you get stuck. Even the hardest of the puzzles in this pack can be thought through logically without any need for trial and error. Keep your eyes pealed for dots that are dead ends and can t be used, and draw the appropriate X s in. You can sometimes eliminate several dots in a row this way. Don t forget the rule that you must draw just one loop. If two ends of a path are about to link up when you still have plenty of clues left to satisfy, you need to ensure those two ends avoid each other. One of the most important observations about Slitherlink puzzles is that every dot is connected to exactly or exactly segments of the loop. Several additional rules can be derived from this observation, especially based on the parity of clues (i.e. whether the clue is even or odd). Remember that the patterns given above are anything but exhaustive, so be prepared to stretch your mind a little for harder puzzles. One of the more enjoyable aspects of solving Slitherlinks is finding these new rules and ideas on your own.

Melon s Puzzle Packs Vol. I: Slitherlink Page 6/ Classic Slitherlinks The following5 Slitherlink puzzles use the standard set of rules. See page for instructions. The example from the tutorial has been reproduced below. Most of the puzzles here are on the easier side, although even hardened veterans might stumble on some of the later ones. Example I. I. I.

Melon s Puzzle Packs Vol. I: Slitherlink Page 7/ I.4 I.5 I.6 I.7 I.8 I.9

Melon s Puzzle Packs Vol. I: Slitherlink Page 8/ I. I. I. I. I.4 I.5

Melon s Puzzle Packs Vol. I: Slitherlink Page 9/ Variation : All Threes In addition to the usual Slitherlink rules, all of the s are given to you. That is, no unclued square has three segments of the loop surrounding it. Example I.6 I.7 I.8

Melon s Puzzle Packs Vol. I: Slitherlink Page / Variation : Interior Path In addition to the usual Slitherlink rules, you must be able to draw a path through adjacent squares that visits every square inside the loop exactly once. The path starts and ends at two different squares. Example I.9 I. I.

Melon s Puzzle Packs Vol. I: Slitherlink Page / Variation : Domino Some of the clues have been taken out of the grid as a given set of dominoes. Their original positions are marked with shaded squares. Find the original position of each domino and solve the resulting Slitherlink puzzle. Example I. I. I.4

Melon s Puzzle Packs Vol. I: Slitherlink Page / Variation 4: Relation In addition to the usual Slitherlink rules, some equality and inequality signs are present between two squares in the grid. The two clues that would be written in these squares must satisfy the given relationship. Example I.5 I.6 I.7

Melon s Puzzle Packs Vol. I: Slitherlink Page / Variation 5: Liar In addition to the usual Slitherlink rules, exactly one of the given clues in each row and column is false. Which clues are false is up to you to determine. Example I.8 I.9 I.

Melon s Puzzle Packs Vol. I: Slitherlink Page 4/ Chimera Slitherlinks The next three puzzles combine two sets of rules from the variations section. I. (Liar + All Threes): Each row and column has exactly one false square. A square is false if it has an incorrect clue or if it is unclued and has segments of the loop surrounding it. I. (Relation + Domino): Place the given dominoes in the grid and solve the resulting Relation Slitherlink puzzle. I. (Liar + Interior Path): Each row and column has exactly one false clue, and there must exist a path traversing each square inside the loop exactly once. I. I. I.

Melon s Puzzle Packs Vol. I: Slitherlink Page 5/ Larger Slitherlinks The next two puzzles are of larger size than past puzzles. I.4: This is a Classic Slitherlink. I.5 (next page): Follow Classic Slitherlink rules. This puzzle has 8 solutions; you must find all of them. To make things easier on you, you may consider a solution determined when you know what it does in the five shaded areas. The clue colors have no bearing on the rules. I.4

I.5

Melon s Puzzle Packs Vol. I: Slitherlink Page 7/ Hints I.: What can be said about a that is adjacent to a second and touches a third diagonally? I.: Be sure to mark Xs around s and any other clues that you have all the segments for. I.: You should be able to determine the segments around every on the main diagonals very early on. I.4: You need to avoid closing the loop several times in this puzzle. Start in the top left and work clockwise. I.5: If you remember the pattern about s in corners, this should be a simple solve. I.6: You can determine the segments around every nonzero clue from the beginning. Solving the rest requires you to avoid dead-ends and closing the loop. I.7: Keep in mind the patterns about s and cornered s. I.8: The only way to satisfy the s in the center is to cut straight through them. I.9: Use the in the top left to start. Remember that if two ends of a path touch the same, they will link up immediately. Make sure you don t close any loops too early. I.: Every region in a Slitherlink puzzle with part of the loop needs at least two entrances/exits. I.: How many ways can you find to satisfy the s in the middle of the first column? I.: There is plenty of loop closing logic in the right half of the puzzle, even if you don t have all the lines. I.: Have you developed any rules about diagonal chains of clues? Remember a dot has either segments or. I.4: If you have an even number of adjacent s, the two ends of the zigzag will be on opposite sides. You can use this fact to force something on the lower left. I.5: It may help to mark squares you know are inside or outside the loop in the fields of s. Also, what happens if any dot surrounded by s is unused by the loop? I.6: Start by considering the bottom left corner. When you finish that area up, be prepared to use the new rule several consecutive times. I.7: Focus on the top at first. Then repeatedly use loop-closing logic to work counterclockwise about the center. I.8: Figure out whether each of RC5 and R9C6 are inside or outside the loop. Knowing both will either force or prevent some segments in the center. I.9: How many s can be inside the loop in any Interior Path puzzle?

Melon s Puzzle Packs Vol. I: Slitherlink Page 8/ I.: You can determine whether a lot of s in the center are inside or outside the loop very early on. I.: If you have a choke point of width one inside the loop, all interior squares on each end must be visited before going through that choke point. I.: Make sure not to draw any segments that would result in two dominoes being the same. I.: Ask yourself where the can go. Later, ask the same thing about the. I.4: No Slitherlink puzzle can have three s in an L-triomino pattern. Also, there are two configurations for the positions of the dominoes; once you find one domino, you know which configuration it is. I.5: The top right and bottom right inequalities are not easily satisfied. I.6: Make as much use as you can of two greater-than or less-than signs in a chain. Often the high end can t be a or the low end can t be a. I.7: The top center is the starting point. Remember that for the purposes of satisfying a relation, having a segment on the relation is inconsequential. Only the other three segments of each square matter. I.8: The four corner configurations are all impossible in normal Slitherlink. I.9: What happens if either of the two s in the center are false? Also recall that an L-triomino of s is not possible in Slitherlink. I.: If you have three s in a triangle configuration, what is the clue in the center allowed to be? I.: There are several patterns in this puzzle that force segments around nearby squares. Also, for some rows and columns it s hard to fit a liar in at all. I.: Start by looking for the,, and, in that order. I.: How many s can be inside the loop in Interior Path? What can be said about a pair of adjacent s if they were both true? I.4: You can continue a diagonal parity chain through an unclued space if you have the two perpendicular ends. I.5: This is a logic circuit in disguise. The shaded areas on top are inputs, and the on bottom are outputs.

Melon s Puzzle Packs Vol. I: Slitherlink Page 9/ Solutions I. I. I. I.4 I.5 I.6 I.7 I.8 I.9 I. I. I.

Melon s Puzzle Packs Vol. I: Slitherlink Page / I. I.4 I.5 I.6 I.9 I. I.7 I. I. I.8 I. I.4

Melon s Puzzle Packs Vol. I: Slitherlink Page / I.5 I.6 I.7 I.8 I.9 I. I. I. I. I.4 I.5 The loop goes either to the left or to the right of the s in each shaded area. Reading the two rows across, the eight solutions are LLL;LL RLL;LR LRL;LR RRL;RL LLR;LR RLR;RL LRR;RL RRR;RR