|
| Administrator
   
Country : India | | | Beta World Problems
| Beta World Problems posted @ 2013-01-30 1:24 PM Nikoli Slitherlink + Masyu hybrid; I don’t know who first put them together but combinations like this aren’t rare. Draw a loop through vertices that cannot intersect itself; each number indicates how many of the four edges around it are drawn; the loop must pass through all large dots, and it must go straight through [...] Posted in puzzles, masyu, puzzle, slitherlink | | Beta World Problems
| Beta World Problems posted @ 2013-02-10 7:55 AM A Naoki Inaba (JP ) type, as seen on Para’s Puzzle Site. Draw a loop through adjacent vertices that cannot intersect itself; each number indicates the total length of all straight segments adjacent to it, where segment length is always measured up to the nearest turns in the loop. Let’s see how well WordPress’s scheduling works [...] Posted in puzzles, contact, logic, puzzle | | Beta World Problems
| Beta World Problems posted @ 2013-02-28 7:10 PM Yay crazy hybrids! I guess this one is kind of hard. Draw a loop through adjacent vertices that cannot intersect itself. For each pair of symmetrically placed numbers, one is a Slitherlink clue which indicates how many of the four edges around it are drawn, and one is a Contact clue which indicates the total [...] Posted in puzzles, contact, logic, puzzle, slitherlink | | Beta World Problems
| Beta World Problems posted @ 2013-03-23 9:56 PM Yeah, and there’s this. chaotic_iak rejected this variant for his February sequence in order to get consistent 7×7 dimensions, so I made one. It’s been about a month. I have no idea why I procrastinated posting it until now. This is a Samurai Fillomino, which means each grid satisfies the constraints on its own. Write [...] Posted in puzzles, fillomino, logic, nikoli, puzzle | | Beta World Problems
| Beta World Problems posted @ 2013-04-27 3:14 PM I survived midterms. This is a Slitherlink mutant. Draw a loop through adjacent vertices that cannot intersect itself. Each number indicates how many of the four edges around it are drawn. In addition, each pair of colored squares in corresponding positions (e.g. R1C1 and R6C6, R2C8 and R7C3 ) must have an equal number of edges [...] Posted in puzzles, logic, nikoli, puzzle, slitherlink | | Beta World Problems
| Beta World Problems posted @ 2013-07-18 8:26 PM Funny, I go on a trip to Penghu followed by a four-day science camp and also get dragged into drawing classes and some sort of movie advising joint, and this is what I decide to blog about. Since it’s summer, I went back to Rankk and solved stuff. This is lots of fun if you’re […] Posted in programming, puzzles, web, rankk, statistics | | Beta World Problems
| Beta World Problems posted @ 2013-07-19 6:56 AM Oops, I forgot the “puzzles” category was semi-reserved for puzzles I constructed/wrote, because among other things an LMI bot is following it. Anyway, if this makes up for anything, I have a puzzle that I’ve procrastinated posting for very, very long. This is a Fillomino puzzle. Inequality signs in the grid must be satisfied by […] Posted in puzzles, fillomino, logic, nikoli, puzzle | | Beta World Problems
| Beta World Problems posted @ 2013-09-30 6:48 PM I’m extremely satisfied — a little incredulous, in fact — with how this puzzle came out. chaotic_iak labels it the “most ridiculous fillomino ever in history”. Apparently, it’s rather tricky. ETA: Journalistic responsibility compels me to mention that chaotic_iak also added, “might be beaten later”. Oops? This is a Fillomino combining the Nonrectangular (polyominoes can’t […] Posted in puzzles, fillomino, logic, nikoli, puzzle | | Beta World Problems
| Beta World Problems posted @ 2013-11-19 10:56 AM ETA 11/19 7:23 AM UTC+8: Fixed some transcription errors on right: R4C17 is D instead of N, and R15C17 is G instead of E. Neither change should greatly impact solvability. Thanks to ksun for pointing out an error. Logic puzzles are easy to construct if one doesn’t have some specific pattern or theme in mind. […] Posted in puzzles, logic, puzzle, puzzlehunt | | Beta World Problems
| Beta World Problems posted @ 2014-04-15 5:55 AM As requested, a puzzle post! Straight from the WTF-variant department. Quite hard. This is a Fillomino, with the additional constraint that for each polyomino, there must not exist a path (i.e. a sequence of cells, each orthogonally adjacent to the next ) that includes each of the polyomino’s cells exactly once (and does not include cells […] Posted in puzzles, fillomino, logic, nikoli, puzzle |
|
Beta World Problems