The IQ test was pretty jokes until the last question
This one got me stumped.
The IQ test was pretty jokes until the last question
This one got me stumped.
The answer might (there is often multiple solution in these kind of questions) be
D
Explanation
with the rules:
1: moves to the right one square every step
2: moves left one square every two steps
3: moves clockwise as the knight in chess every step
4: moves counter-clockwise only on corners every step
I think you all overthink it... how about just
4-3-4-4-3-4
the answer is H
How about this:
G
Rules:
1: there is an integer sequence capturing the number of total coloured squares: 4-3-4-4-3-3
2: there is an integer sequence capturing the maximum number of connected coloured squares: 2-3-3-4-2-3
3: there is an integer sequence that captures the number of connected coloured squares: 3-1-2-1-2-1 it is not clear how it progresses from there onwards but it is clear that there is an alternation between some integer k and 1.
I think the logic is quite vague. It seems each cube piece has its own local rule all from 1-9. The choices being, of course, b+b, w+w, b+w.
Then we can piece together the last cube. Succinctly that would be
From that our given cubes semi-final and final are 1-b+w, 2-b+w, 3-w+w, 4-w+w, 5-b+w, 6-w+b, 7-w+b, 8-b+w, 9-w+b. If we apply the rule we get 1-w, 2-w, 3-b, 4-b, 5-w, 6-b, 7-w, 8-w, 9-w. So, wwb, bwb, www. Okay some nuance. 6-b was changed due to the ambiguity in corner 5 that can be used to generate this answer which is B. In short I treated this as a 9 systems of equation and did it one by one, by imposing 1 picture onto another.