Neighbours
![]()
On has just today posted a new mini-game to his Eyezblog, and it is a simple little puzzle game called Neighbors.
The game is played by dragging each of the colored-top creatures to one of the 9 container pots such that everyone gets along happy and content. If you put one in the wrong spot, its neighbor(s) won't like it and will have a tizzy fit.
It's a cute game that shows off On's creative animations and charming characters that are so unique and of a style all his own. And while the puzzle game may not keep you occupied for long, it's always a red letter day when a new game pops up over at Eyezmaze. Click.























Walkthrough Guide
This is an exelent game. Really good replay value, At least if you are trying to find a method that can give you an A every time.(I can now get C in 21-23 moves every time sometimes B in 20)
Here are some clues to my method.
Hint:
Not being neighbours is the most abundant information in this game. How to use this?
My method:
Use Home and away matrix. String up the colours that goes together. Ex: 1-2-3 (which also means 3 can't like 1 and you dont have to test that)
The string makes use of known enemies. Ex: 4-5-6-7 (if 7 doesn't like 4 it can't make a square)
By 9-12 moves you should have the basic string configuration.
Testing:
Try testing as many colours as possible to build up a long string. Enemies tells you about the possible configurations of the string
Game flaw? :
If yor not lucky with the positions of the testing pieces it's very difficoult with this method to get below 20.
It should be possible in a game of logic to get an A by logic not luck. Perhaps I use the wrong method or have overlooked something. If not, I think it's a flaw in the ranking system of the game.
CHALLENGE!
Find a way to solve this puzzle in 15 moves every time.
Posted by: drNumLock | March 1, 2007 1:26 PM