Earlier quoted context omitted.
Your third row contains 3 B's and only one r. Each row and column has to have an equal number of each.
Well that's embarrassing.
0h h1 – A little logic game
141–150 of 165 posts
Re: 0h h1 – A little logic game
#142Earlier quoted context omitted.
Well that's embarrassing.
Earlier today when I saw this thread I came to post my game that "should have won but didn't", only to see to many other people posting the same. For me it was the "no duplicate columns or rows" rule that I didn't notice. Something about this game is tripping a lot of people up.
Re: 0h h1 – A little logic game
#14310x10 solved. It seems too easy. It is almost an auto solver, you just have to find two blocks of the same color together, or two blocks with the same color with an empty block in-between. Great for a young person, but I would like to see a version with more rules and constraints to follow. The UI and the UI feedback is outstanding though.
Oddly enough, I found the 10x10 easier to solve then the 6x6 and the 8x8. After a couple play-throughs I think I know why. When trying to determine your next move, there's 3 options. 1. Look for a chance to play a block that wouldn't cause a chain of 3 colors together. 2. Look so see if the row or column has enough of a certain color in it. 3. Look to see if the row or column is a duplicate of another. 1 and 2 are ea…
Take this one, for instance:
- O - - - -
X - - O X -
- - - - - -
O - X - O -
- - - - - O
X - O - X -
This puzzle has the unique solution shown below, but none of your three heuristics will make any progress on it. O O X X O X
X X O O X O
X O O X O X
O X X O O X
O X X O X O
X O O X X O
One of the ways you can solve this is to note that the square in the upper-left corner must be O. This is because if it were X, then there would be three adjacent Os in the first column. This insight is due to calebcjh@gmail.com.Re: 0h h1 – A little logic game
#144Love the game. Just wrote a solver in Python: https://github.com/fogleman/OhHi/blob/master/main.py
'00....',
'110010',
'......',
'0.1.0.',
'.....0',
'1.0.10',
This puzzle has a unique solution (See https://news.ycombinator.com/item?id=8606098). To give your solver a hint sufficient to solve the puzzle, set the first row to: '00..0.',Re: 0h h1 – A little logic game
#145Interesting! It looks like the game never requires you to backtrack, there's always a way forward by applying some rule exactly once. I guess that's why you have the requirement for unique rows and columns (which is pretty jarring gameplay wise), otherwise the forced games would be much more boring. That kinda limits the possible intellectual enjoyment from the game, though. Without the requirement for unique rows an…
There are puzzles of this type that require either backtracking or exceedingly complex heuristics. However, the site only seems to generate simple puzzles that do not require backtracking.
Re: 0h h1 – A little logic game
#146It's written in clingo (http://en.wikipedia.org/wiki/Answer_set_programming)
Re: 0h h1 – A little logic game
#147Earlier quoted context omitted.
Oddly enough, I found the 10x10 easier to solve then the 6x6 and the 8x8. After a couple play-throughs I think I know why. When trying to determine your next move, there's 3 options. 1. Look for a chance to play a block that wouldn't cause a chain of 3 colors together. 2. Look so see if the row or column has enough of a certain color in it. 3. Look to see if the row or column is a duplicate of another. 1 and 2 are ea…
Those three heuristics seem to work for the puzzles on the site, due to a limitation of the site's puzzle generator. However, there exist puzzles of this type which cannot be solved using only those three heuristics. Take this one, for instance: - O - - - - X - - O X - - - - - - - O - X - O - - - - - - O X - O - X - This puzzle has the unique solution shown below, but none of your three heuristics will make any progr…
Re: 0h h1 – A little logic game
#148Earlier quoted context omitted.
I always wonder with these kinds of puzzles how one can come up with an initial settings that (a) yields a unique correct solution and (b) has a logical next step at every step (so doesn't require thinking ahead x steps to arrive at a conflict)
For at least Loopy, the generator works by generating a full puzzle with all hints, and then removing hints one at a time until the solver can't solve the puzzle. So the complexity of the puzzles that can be generated are dependent on the cleverness of the solver.
Re: 0h h1 – A little logic game
#149Re: 0h h1 – A little logic game
#150A few bits of feedback: - There's no list of rules anywhere. If you forget any rule, you need to go through the tutorial again. - Is the tutorial missing a rule? (It has the "no two identical rows" rule, but it seems like you also can't have two identical columns). - The endgame needs work. Right now it's simply highlighting every square that's wrong, rather than just telling which rule was broken. This is absolutely…
I have to agree with (a) here. Upon reaching the end of a 6x6, as far as I could tell no rules were broken, yet the solution was not valid. I'm wondering if multiple solutions can exist and the game will only accept one.