安装 Steam
登录
|
语言
繁體中文(繁体中文)
日本語(日语)
한국어(韩语)
ไทย(泰语)
български(保加利亚语)
Čeština(捷克语)
Dansk(丹麦语)
Deutsch(德语)
English(英语)
Español-España(西班牙语 - 西班牙)
Español - Latinoamérica(西班牙语 - 拉丁美洲)
Ελληνικά(希腊语)
Français(法语)
Italiano(意大利语)
Bahasa Indonesia(印度尼西亚语)
Magyar(匈牙利语)
Nederlands(荷兰语)
Norsk(挪威语)
Polski(波兰语)
Português(葡萄牙语 - 葡萄牙)
Português-Brasil(葡萄牙语 - 巴西)
Română(罗马尼亚语)
Русский(俄语)
Suomi(芬兰语)
Svenska(瑞典语)
Türkçe(土耳其语)
Tiếng Việt(越南语)
Українська(乌克兰语)
报告翻译问题



So, start with question #1 and try each answer: A, B, C, D
Then move to question #8, since it involves the answer to #1:
You will see that if #1 is B, then D is the only letter not adjacent to B or if #1 is C than A is the only possible answer not adjacent. The other 2 choices for #1 lead to 2 possible answers of not adjacent, so trying B or C for #1 is the easiest.
After that it becomes more complicated.
#8 implies that only one of questions 7, 5, 2, and 10 can equal D if the answer to #1 is B and so on.
Very complicated logic. Each answer A-D for each question changes the answers to all of the other questions. Only one choice for each can be true while making all of the others true as well.
And the best part is, it really freaks out Google's AI mode. It gives a different solution every time you ask the same question. Try it. It's fun. Copy and paste all 10 questions as one long Google search and the AI will give a different answer every time. Just one more reason why AI in its current state sucks.
But, once again, what does this have to do with criminal investigation?
No crime has ever been solved by answering a series of stupid "the answer to question 1 is the answer to question 3, divided by the answers to question 2 and 6, where question 9 is...."
We see this all the time in the software developer interview scene, where interviewers think that stupid puzzler questions like this find the best candidates. Experienced coders don't waste their time with these.
7, 10 require knowledge of near the entire set so likely solved last... but you can infer from them that only one letter is used least (so no ties for last place) and that no letter can be used more than 5 times.
If you know 5, you know 2
Because the way it is worded, one and only one of the following is true: 8A, 4B, 9C or 7D
which is:
3 out of 3,6,2 and 4 are the same, one is different (and the answer to 3). So solving 3 is huge.
Since each of the 40 data points is either true or false, it might be solvable with a grid.
Eh it's nearly 1 AM, so I'll have to let someone else do this one.
Since the set of answers must total 10 elements, min gap 1 max gap 4
Lowest cannot be used twice or more (2,3,3,3>10)
If lowest is only used once, gap is 2 or more (since 1+2+2+2<10)
If lowest is never used, gap is 4 (0,3,4,4) since (0,3,3,3<10)
10 cannot be D (1)
Disttrubution of answers is:
0,3,4,4
1,3,3,3
1,2,3,4
or 1,2,2,5
BCACA CDABA
Yes, people also believe in the fallacy that solving obtuse, abstract puzzles is the "core skill" that makes one a good programmer.
It's like asking someone to construct a wheel out of toothpicks and gum, and if they can't, they aren't qualified to work at NASA. It might make some HR person think that they're clever, but people with actual job experience roll their eyes and look elsewhere.
5. Which question below has the same answer as this one?
A. Question 8 (A, 7 is a letter not adjacent to 1)
B. Question 4 (B, 2=7)
C. Question 9 (C, 2 is to 5 opposite what 1 is to 6)
D. Question 7 (D, D is the least common answer)
If
B. Question 4 (B, 2=7)
2. The answer to question 5 is: ("B", so D)
7. Among these ten questions, the letter option chosen least often is:(D)
Since the least used is used either 0 or 1 times (see post 17) it can not be D for both 2 and 7
Therefore we can eliminate 5 B
That's 2 out of 40!