[CV020] Unfriendly Neighbors

020 - Unfriendly Neighbors

Unfriendly Neighbors (Unfriendly Commute in the UK version) is a puzzle in Professor Layton and the Curious Village.

Puzzle

Draw a path between one man's home and his work by connecting matching blocks.

The catch is that these men can't stand each other, so you have to make sure that none of the paths touch.

To make a path, all you need to do is tap a block and start drawing.

Hints

Click a Tab to reveal the Hint.

You might think that this puzzle is impossible, but rest assured, it's not.

The first thing you should try to do is connect any pair of blocks. That'll limit where your next path can go. B's route is shortest. Try enough times and you're sure to figure it out.

The path between the b blocks is a straight line. D goes around to the north.

As stated earlier, connect the pair of b blocks with a straight line. Then connect the d blocks by drawing a path that arcs up over the b block path. A goes south then east.

Got it now?

Solution

Correct

That's right!

Now those guys don't even have to look at each other! Good job!

v · d · ePuzzles in Professor Layton and the Curious Village

Normal	001 002 003 004 005 UK 006 007 008 009 010 UK JP 011 012 013 014 015 016 017 JP 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 JP 035 036 037 038 039 040 041 042 043 044 045 UK 046 UK 047 048 049 050 UK 051 052 053 054 055 056 057 058 059 060 061 062 UK 063 064 065 066 UK 067 UK 068 069 070 071 072 UK 073 074 075 076 UK 077 078 079 080 081 082 083 084 085 UK 086 087 088 UK 089 090 091 092 093 094 095 096 UK 097 098 099 100 101 102 103 104 105 106 107 108 109 110 111 UK 112 113 UK 114 115 116 117 118 119 120 121 122 123 124 UK 125 126 127 128 129 130 131 132 133 134 135

Weekly	See here for weekly puzzles

Puzzle Index: CV · DB · UF · LS · MM · AL · VS · LMJ