Thread replies: 19
Thread images: 6
Thread images: 6
File: red white blue.png (117KB, 2120x1244px) Image search:
[Google]
117KB, 2120x1244px
How smart are you /g/? Can you solve this?
Rules:
>You can only go in the order red > white > blue > red > white > blue, and so on.
Start at the red dot, pass through the red wall, and from then on you must pass through a white wall and then a blue and then a red.
Your goal is to exit through the blue wall at the top of the maze.
Submit as drawings or feel free to go "up, right, up left, down".
Well, /g/? Are you truly as smart as you say you are? Is your IQ really above 300?
>>
>>55004849
this is just tree traversal
humans are not good at tree navigation
>>
File: 1465538058037.png (39KB, 2120x1244px) Image search:
[Google]
39KB, 2120x1244px
ez
>>
>>55004872
This. You make a directed graph with three vertices for each location in a puzzle, one for each color representing the next color move you are required to make. Each colored wall represents a pair of edges between two of those three spaces. Compute shortest paths on the resulting directed graph and you have your route (if any).
I'm too lazy to actually implement it, but this will give you all the answers.
>>
File: mazes_some.png (94KB, 2120x1244px)
94KB, 2120x1244px
>>55004849
meh, a couple
>>
>>55004849
>somebody actually bothered to camouflage his homework as a "smartness test" hoping we would make it for him
Should've asked in the /sqt/ and they would've explained you.
>>
>>55004920
Oh, you so smat, ma nig.
>>
File: 3.png (7KB, 492x533px)
7KB, 492x533px
>>55005827
3
>>
File: 4.png (7KB, 438x549px)
7KB, 438x549px
>>55006562
4
>>
>>55004849
Number one is unsolvable, didnt bother with others.
>>
>>55006659
you're retarded
>>
>>55006613
5 and 6, I gave up on 7 and I'm going to sleep
>>
>>55006679
Show it then how to solve number 1
>>
These were clearly made by a human, not randomly generated.
If you work backwards then the 'right way' there's very little trial and error.
>>
>>55006720
If you look at the images in the thread you'll notice someone did 1-6 already.
>>
>>55004849
8 is impossible?
>>
>>55007086
Make a sloving program and see for yourself.
>>
construct the adjacency matrix and throw linear algebra at it.
once you know whether a solution exists and how long it is, you can quickly retrace it.
I did the first by hand, but its not much harder to extract the data form the image directlyfrom numpy import *
# 17
# 13 14 15 16
# 9 10 11 12
# 5 6 7 8
# 1 2 3 4
# 0
MR = zeros((18,18))
MW = zeros((18,18))
MB = zeros((18,18))
red = [(0,2), (3,4), (1,5), (6,7), (8,12), (10,11), (12,16), (13,14),(14,15)]
blue = [(1,2),(2,3),(3,7),(5,6),(7,8),(6,10),(9,10),(11,12),(9,13),(11,15),(15,17)]
white = [(2,6),(4,8),(5,9),(7,11),(10,14),(15,16)]
for i in red: MR[i] = 1
for i in blue: MB[i] = 1
for i in white: MW[i] = 1
MR = MR + MR.T
MB = MB + MB.T
MW = MW + MW.T
A = MB.dot(MW).dot(MR) # adjacency matrix for taking 3 steps
start = array([1]+[0]*17)
finish= array([0]*17+[1])
print finish.dot( matrix(A)**8 ).dot(start) # 1, a path of length 3*8 exists
Thread posts: 19
Thread images: 6
Thread images: 6