[ANN][iQ CONTEST] 100K iQCash mined! Celebration puzzle: 100 $Waves to winner.

[iQCash]

Bonus Question 2:

(I hope you can read it)

https://www.dropbox.com/s/iqijidhiwllapsb/solution.jpg?dl=0

Sorry, no. What we are looking for for bonus ques. 2 is a mathematical formula to describe as best as possible the calculation that you have performed.

The formula should be written with standard mathematical notation. e.g. f(x) = f(x_n-1) - xⁿ⁺¹

That's not the answer, and probably not even close, but just an example of the type of layout that is required.

[Vip0r]

Bonus Question 1:

How many arrows have to change colour that all paths have the same speed. -> 10 blue in the middle. 10 = X

[Vip0r]

Maybe the answer for Question 1 is:
How many hearts are there? I can find 10 and like I said before   10 = X

[synthet]

re Bonus Question 2:

the algo for the solution is kinda similar to how a NN (neural network) is built...

1. every column of nodes (not arrows) in the puzzle is a separate layer;
2. each layer consists of a number of nodes (n_i), so i-th layer has n_i nodes;
3. every node in i-th layer is connected to some nodes in layer i-1;
4. let T_i be the transformation matrix that describes how nodes from i-th layer are connected to nodes in layer i-1, T_i is size of (n_i*n_i-1);

a simple example:
 ↗  ↘  ↗  ↘
 ↘  ↗      ↗
     ↘  ↗
there are 4 layers - (layer 0 - the initial layer, containing only one node), layer 1 - contains 2 nodes, layer 2 - contains 2 nodes, layer 3 - contains 2 nodes and layer 4 - contains 1 node (final node);
if a j-th node in i-th layer is connected to a k-th node in layer i-1 you write 1 in place (j,k - j-th row, k-th column) of the T_i matrix, otherwise you write 0:
T₁ = [ 1; 1 ], of size (2x1) or (n₁*n₀);
T₂ = [ 1 1; 0 1 ], of size (2x2) or (n₂*n₁);
T₃ = [ 1 0; 0 1 ], of size (2x2) or (n₃*n₂);
T₄ = [ 1 1 ], of size (1x2) or (n₄*n₃);

5. let W_i be the vector that describes how many paths lead to every node in i-th layer, so W_i is size of (n_i*1);

now the formula:
W_i = T_i * W_i-1;    (1)
W₀ = [1];

considering there are 22 layers in the puzzle and 22 transformation matrices, the solution can be calculated by repeating (1) for each layer (column) in the puzzle, here is a pseudo-code:

W₀ = [1];
for (i = 1:22)
   W_i = T_i * W_i-1;
Answer = W₂₂;

or:
Answer == W₂₂ = T₂₂ * T₂₁ * T₂₀ * ... * T₁ * W₀;

and for my simple example:
W₀ = [1];
W₁ = T₁ * W₀ = [ 1; 1 ] * [1] = [ 1; 1];
W₂ = T₂ * W₁ = [ 1 1; 0 1 ] * [ 1; 1 ] = [ 2; 1];
W₃ = T₃ * W₂ = [ 1 0; 0 1 ] * [ 2; 1 ] = [ 2; 1];
W₄ = T₄ * W₃ = [ 1 1 ] * [ 2; 1 ] = [ 3 ];
answer - there are 3 paths

[iQCash]

Bonus Question 1:

How many arrows have to change colour that all paths have the same speed. -> 10 blue in the middle. 10 = X

That's not the intended puzzle, but it does work as a puzzle, so I'll award a bonus prize for that one, either 5 Waves or 10 if no-one finds the other puzzle.

Well spotted. PM your Waves address!

[iQCash]

Maybe the answer for Question 1 is:
How many hearts are there? I can find 10 and like I said before   10 = X

Another nice try, but you'd have to include sideways hearts which look more like arrows, so this one doesn't quite make it.

(You'd also have to accept hearts with different proportions to total up to 10 too.)

[iQCash]

re Bonus Question 2:

the algo for the solution is kinda similar to how a NN (neural network) is built...

1. every column of nodes (not arrows) in the puzzle is a separate layer;
2. each layer consists of a number of nodes (n_i), so i-th layer has n_i nodes;
3. every node in i-th layer is connected to some nodes in layer i-1;
4. let T_i be the transformation matrix that describes how nodes from i-th layer are connected to nodes in layer i-1, T_i is size of (n_i*n_i-1);

a simple example:
 ↗  ↘  ↗  ↘
 ↘  ↗      ↗
     ↘  ↗
there are 4 layers - (layer 0 - the initial layer, containing only one node), layer 1 - contains 2 nodes, layer 2 - contains 2 nodes, layer 3 - contains 2 nodes and layer 4 - contains 1 node (final node);
if a j-th node in i-th layer is connected to a k-th node in layer i-1 you write 1 in place (j,k - j-th row, k-th column) of the T_i matrix, otherwise you write 0:
T₁ = [ 1; 1 ], of size (2x1) or (n₁*n₀);
T₂ = [ 1 1; 0 1 ], of size (2x2) or (n₂*n₁);
T₃ = [ 1 0; 0 1 ], of size (2x2) or (n₃*n₂);
T₄ = [ 1 1 ], of size (1x2) or (n₄*n₃);

5. let W_i be the vector that describes how many paths lead to every node in i-th layer, so W_i is size of (n_i*1);

now the formula:
W_i = T_i * W_i-1;    (1)
W₀ = [1];

considering there are 22 layers in the puzzle and 22 transformation matrices, the solution can be calculated by repeating (1) for each layer (column) in the puzzle, here is a pseudo-code:

W₀ = [1];
for (i = 1:22)
   W_i = T_i * W_i-1;
Answer = W₂₂;

or:
Answer == W₂₂ = T₂₂ * T₂₁ * T₂₀ * ... * T₁ * W₀;

and for my simple example:
W₀ = [1];
W₁ = T₁ * W₀ = [ 1; 1 ] * [1] = [ 1; 1];
W₂ = T₂ * W₁ = [ 1 1; 0 1 ] * [ 1; 1 ] = [ 2; 1];
W₃ = T₃ * W₂ = [ 1 0; 0 1 ] * [ 2; 1 ] = [ 2; 1];
W₄ = T₄ * W₃ = [ 1 1 ] * [ 2; 1 ] = [ 3 ];
answer - there are 3 paths

Impressive. You're definitely in the lead for the 20 Waves for this question!

[synthet]

BTW I wrote all the T-matrices down so anyone can check that the algo is correct:

if you have matlab installed on your machine (you can also use octave-online.net) put this code into the command promt, W22 will be equal to 415:

T1 = [1; 1];
T2 = [1 0; 1 1; 0 1];
T3 = [1 0 0; 0 1 0; 0 0 1];
T4 = [1 0 0; 0 1 0; 0 0 1; 0 0 1];
T5 = [1 0 0 0; 1 0 0 0; 0 1 0 0; 0 1 1 0; 0 0 1 1; 0 0 0 1];
T6 = [1 1 0 0 0 0; 0 0 1 1 0 0; 0 0 0 1 1 0; 0 0 0 0 1 1];
T7 = [1 0 0 0; 0 1 0 0; 0 0 1 1];
T8 = [1 0 0; 1 0 0; 0 1 0; 0 0 1];
T9 = [1 0 0 0; 1 1 0 0; 0 1 1 0; 0 0 1 1; 0 0 0 1];
T10 = [1 0 0 0 0; 0 1 0 0 0; 0 1 1 0 0; 0 0 1 1 0; 0 0 0 1 0; 0 0 0 0 1];
T11 = [1 0 0 0 0 0; 0 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 0 1 0; 0 0 0 0 0 1];
T12 = [1 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 0 1 1];
T13 = [1 0 0 0; 1 0 0 0; 0 1 0 0; 0 0 1 0; 0 0 0 1; 0 0 0 1];
T14 = [1 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 1 0 0; 0 0 0 0 1 1];
T15 = [1 0 0 0 0; 1 0 0 0 0; 0 1 0 0 0; 0 0 1 0 0; 0 0 0 1 1; 0 0 0 0 1];
T16 = [1 0 0 0 0 0; 0 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 1 0 0; 0 0 0 0 1 1];
T17 = [1 0 0 0 0 0; 0 1 1 0 0 0; 0 0 1 1 0 0; 0 0 0 1 1 0; 0 0 0 0 1 0; 0 0 0 0 0 1];
T18 = [1 1 0 0 0 0; 0 1 1 0 0 0; 0 0 1 1 0 0; 0 0 0 1 1 0; 0 0 0 0 1 1];
T19 = [1 1 0 0 0; 0 0 1 0 0; 0 0 0 1 1];
T20 = [1 0 0; 0 1 0; 0 0 1];
T21 = [1 1 0; 0 1 1];
T22 = [1 1];

W22 = T22 * T21 * T20 * T19 * T18 * T17 * T16 * T15 * T14 * T13 * T12 * T11 * T10 * T9 * T8 * T7 * T6 * T5 * T4 * T3 * T2 * T1;

disp('TOTAL NUMBER OF PATHS LEADING TO BETA IS:');
disp(W22);

[Vip0r]

Bonus question 1:
How many diamonds can you find in the first big Waves Logo (smaller and bigger ones)?: 10 -> 10 = X

[iQCash]

Bonus question 1:
How many diamonds can you find in the first big Waves Logo (smaller and bigger ones)?: 10 -> 10 = X

Unfortunately no. Hint: The last hidden puzzle doesn't use the Roman numeral for 10, so the number 10 is not your target!

[iQCash]

BTW I wrote all the T-matrices down so anyone can check that the algo is correct:

if you have matlab installed on your machine (you can also use octave-online.net) put this code into the command promt, W22 will be equal to 415:

T1 = [1; 1];
T2 = [1 0; 1 1; 0 1];
T3 = [1 0 0; 0 1 0; 0 0 1];
T4 = [1 0 0; 0 1 0; 0 0 1; 0 0 1];
T5 = [1 0 0 0; 1 0 0 0; 0 1 0 0; 0 1 1 0; 0 0 1 1; 0 0 0 1];
T6 = [1 1 0 0 0 0; 0 0 1 1 0 0; 0 0 0 1 1 0; 0 0 0 0 1 1];
T7 = [1 0 0 0; 0 1 0 0; 0 0 1 1];
T8 = [1 0 0; 1 0 0; 0 1 0; 0 0 1];
T9 = [1 0 0 0; 1 1 0 0; 0 1 1 0; 0 0 1 1; 0 0 0 1];
T10 = [1 0 0 0 0; 0 1 0 0 0; 0 1 1 0 0; 0 0 1 1 0; 0 0 0 1 0; 0 0 0 0 1];
T11 = [1 0 0 0 0 0; 0 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 0 1 0; 0 0 0 0 0 1];
T12 = [1 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 0 1 1];
T13 = [1 0 0 0; 1 0 0 0; 0 1 0 0; 0 0 1 0; 0 0 0 1; 0 0 0 1];
T14 = [1 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 1 0 0; 0 0 0 0 1 1];
T15 = [1 0 0 0 0; 1 0 0 0 0; 0 1 0 0 0; 0 0 1 0 0; 0 0 0 1 1; 0 0 0 0 1];
T16 = [1 0 0 0 0 0; 0 1 0 0 0 0; 0 0 1 0 0 0; 0 0 0 1 0 0; 0 0 0 1 0 0; 0 0 0 0 1 1];
T17 = [1 0 0 0 0 0; 0 1 1 0 0 0; 0 0 1 1 0 0; 0 0 0 1 1 0; 0 0 0 0 1 0; 0 0 0 0 0 1];
T18 = [1 1 0 0 0 0; 0 1 1 0 0 0; 0 0 1 1 0 0; 0 0 0 1 1 0; 0 0 0 0 1 1];
T19 = [1 1 0 0 0; 0 0 1 0 0; 0 0 0 1 1];
T20 = [1 0 0; 0 1 0; 0 0 1];
T21 = [1 1 0; 0 1 1];
T22 = [1 1];

W22 = T22 * T21 * T20 * T19 * T18 * T17 * T16 * T15 * T14 * T13 * T12 * T11 * T10 * T9 * T8 * T7 * T6 * T5 * T4 * T3 * T2 * T1;

disp('TOTAL NUMBER OF PATHS LEADING TO BETA IS:');
disp(W22);

That's awesome. You'll be a star at some of the later rounds of iQCash mining!

But then again, the progress of the puzzle rounds is intentionally educational, so there may be a lot of miners who have caught up by that time.

[slayz0r_]

Bonus question 1:

How many steps are there from the beginning to the end if you also count in alpha and beta? -> 24 -> X

[iQCash]

Bonus question 1:

How many steps are there from the beginning to the end if you also count in alpha and beta? -> 24 -> X

Nope. That's not it.

Another hint: It's related to one of the round 1 puzzle types on iQCash.net

[sabine80]

Bonus question 1:

How many steps are there from the beginning to the end if you also count in alpha and beta? -> 24 -> X

Nope. That's not it.

Another hint: It's related to one of the round 1 puzzle types on iQCash.net

it's not easy to solve the puzzle. i break my head all the time, which could be x. hope the next hint give me a new idea.

[slayz0r_]

There are 25 yellow tiles, I don't think you misscounted them as 24, but that's really the only possible answer I can think of at the moment.

[iQCash]

There are 25 yellow tiles, I don't think you misscounted them as 24, but that's really the only possible answer I can think of at the moment.

Nope.

[slayz0r_]

Wow, that's a really hard one. I don't think I will solve this without another hint. I already spent way too much time looking at that graph 

[sabine80]

what happened today? the solved puzzle doubled to over 200k in only 24 hours. impressive, but i hope that are not bots. this would be very unfair.

[iQCash]

what happened today? the solved puzzle doubled to over 200k in only 24 hours. impressive, but i hope that are not bots. this would be very unfair.

Yes, a bot just mined 80k iQCash!

We are implementing better countermeasures, but I think the battle has just begun.
Obviously, it feels like cheating and it feels very unfair, but in one sense it's not so bad: The individual had to to do some work to earn them - and the point of iQCash is that they're earned by a human doing intellectual work.
We'll just have to make absolute sure (with better countermeasures) that the amount of work required to earn them this way would be less attractive than actually doing the puzzles.
Hopefully the early rounds don't turn into a battle of bots, but if they do, it'll be limited to the first few rounds only. Later rounds will require more human comprehension and analysis.
A positive takeaway is that at least we're getting noticed...

After this contest is over, this thread may slide away, so you can follow the Telegram group for updates and discuss any issues:
t.me/iQCash

[iQCash]

Just under a week to go. The prize for identifying the second hidden puzzle has doubled to 20 Waves.

Clue: It's based on one of the round 1 puzzles on iQCash.net, but it is not based on 'How many Squares?' (which was the first hidden puzzle) and it's not based on 'Color Squares' which was tried already, and it's obviously not based on Crossword puzzles or Word Ladder or Balance Scales.

Also, with no alternatives being presented, it's looking good for the only mathematical solution that was offered to win 20 Waves.