Hearthstone Newbie Tuesdays Weekly Discussion

Newbie Tuesdays Weekly Discussion
New Card: Savory Deviate Delight
average standard player
Change my mind
Well met !!!
New Card: Fangbound Druid
Juicy
Blizzarrrrrrrdd!
The Token Art for Deviate Dreadfang!
This is where procrastination gets you, folks.
New Wailing Cavern cards spoiled: one of these is not like the others!
Le secret
Ragnaros Perfection
How I solved the Hearthstone Rogue Mystery Achievement Puzzle by myself
[Photoshop] Verdan the Everliving from Wailing Caverns!
Neither of us had lost a single round until the end!
New Card (Official Translation): Deviate Dreadfang
how is it even possible
Where is the rest of the cards?
Blizzard missed the chance on this card
Did we wait 3 days for 2 cards to be revealed?
The best Druid skin in the world
Having this combo pulled on me was the highlight of my gameplay today!
Dr. 6, Dr. 7 and Dr. 8.
Even mage is so much fun!!

Posted: 31 May 2021 09:01 PM PDT

Hello members of the /r/hearthstone community,

This is part of a series of weekly threads aimed at both new and old players from the community. It is designed so that everybody may ask any and all questions regarding the game's mechanics, decks, strategies and more.

Please keep it clean and try to add more than just a one or two word response. As the goal of this post is to increase the community's knowledge, the thought process matters as much as the answer! There is also a PullsDay Thursday weekly post, for those who want to share their pulled packs.

[Sticky Threads and Guides - Great resources for new players!](https://www.reddit.com/r/hearthstone/wiki/resources#wiki_sticky_threads)

Note: I am a bot. Questions or feedback regarding this thread? [Message the moderators.](http://www.reddit.com/message/compose?to=%2Fr%2Fhearthstone)

submitted by /u/AutoModerator
[link] [comments]

New Card: Savory Deviate Delight

Posted: 01 Jun 2021 10:00 AM PDT

submitted by /u/quacak
[link] [comments]

average standard player

Posted: 01 Jun 2021 12:43 PM PDT

submitted by /u/Semolution
[link] [comments]

Change my mind

Posted: 01 Jun 2021 03:18 AM PDT

submitted by /u/HanoiBogan
[link] [comments]

Well met !!!

Posted: 01 Jun 2021 05:41 AM PDT

submitted by /u/Absolute011
[link] [comments]

New Card: Fangbound Druid

Posted: 01 Jun 2021 10:02 AM PDT

submitted by /u/quacak
[link] [comments]

Juicy

Posted: 01 Jun 2021 04:20 AM PDT

submitted by /u/Towboat_
[link] [comments]

Blizzarrrrrrrdd!

Posted: 01 Jun 2021 01:02 PM PDT

submitted by /u/-HurriKaine-
[link] [comments]

The Token Art for Deviate Dreadfang!

Posted: 01 Jun 2021 10:12 AM PDT

submitted by /u/quacak
[link] [comments]

This is where procrastination gets you, folks.

Posted: 01 Jun 2021 06:39 AM PDT

submitted by /u/quacak
[link] [comments]

New Wailing Cavern cards spoiled: one of these is not like the others!

Posted: 01 Jun 2021 10:05 AM PDT

submitted by /u/TopWeaselhs
[link] [comments]

Le secret

Posted: 31 May 2021 10:27 PM PDT

submitted by /u/assyrianshafer
[link] [comments]

Ragnaros Perfection

Posted: 01 Jun 2021 01:58 PM PDT

submitted by /u/Cipher_Nyne
[link] [comments]

How I solved the Hearthstone Rogue Mystery Achievement Puzzle by myself

Posted: 01 Jun 2021 12:22 PM PDT

This is how to I solved the rogue mystery achievement puzzle by myself. Multiple platforms claim that their solution was found by brute forcing it, however the solution can be guessed somewhat fairly by applying logic which is why I am sharing my thought process here. Be aware that this contains major spoilers, so if you want to solve it by yourself aswell, good luck and back out now!

Playing with the puzzle, I figured out some simple rules first:

you can restart the puzzle by clicking on your hero power, always giving you the same minions
killing all enemy minions or all keys is not the solution
Attacking will change the attack values of multiple minions.
The attack values are not assigned randomly, but rather depend on where you attack

It seemed to be a good idea to figure out how the attack values are assigned in more detail:

the attack value of the keys after attacking is equal to 1+the attack value of the minion you were attacking.
Attacking an enemy minion with one of your keys will raise its attack value by 1.
Key attack points are in the range from 1-10 while enemy minion attack points are in the range of 0-9.
Attacking will change the attack values of multiple other enemy minions aswell.

But how do they change exactly? I took some time to realize that they do not depend on the attack or health values prior to the attack, nor on the attack values or health values of the keys, nor on which key you are actually using, but rather only on which enemy minion you are attacking:

Attacking a certain enemy minion will change all attack values by a constant amount.

Meaning that attacking the first enemy minion always changes the attack points of the first enemy minion by 1, raising the attack points of the second enemy minion by 2, and so on.

Attacking the second enemy minion always reduces the attack points of the first enemy minion by to, raising the attack points of the second enemy minion by 1 and soon.

Since the attack values are in the range of [0;9], numbers wrap around. Mathematically this can be described as using modulo (%) 10 (or only looking at the last digit of the number). This works well for addition but fails for substraction, which is why you end up formulating -1 as +9, -2 as +8 and -3 as +7.

You end up with a table describing the systems behavior in regards to attack values depending on where you attack, all in vector notation:

Start: ( 5 1 0 2 0 5 2 )

Attacking the 1st enemy minion: ( 1 2 1 8 2 0 7 )

Attacking the 2nd enemy minion: ( 8 1 8 8 3 8 8 )

Attacking the 3rd enemy minion: ( 0 8 1 1 2 8 8 )

Attacking the 4th enemy minion: ( 0 0 1 1 8 3 7 )

Attacking the 5th enemy minion: ( 7 0 9 2 1 8 3 )

Attacking the 6th enemy minion: ( 2 3 2 7 0 1 1 )

Attacking the 7th enemy minion: ( 8 8 9 7 0 3 1 )

Now that the system is fully described, it is time to search for the goal. Since all boxes show a 0, my approach was to figure out how to get the solution vector ( 0 0 0 0 0 0 0 ). For this, you figure out that

attacking at the same position 10 times in a row gets you to the original state again
it does not matter in which order you attack on different positions, only how often you attack on a certain position
combining these to gets you to the point that you are essentially searching for a 7-digit number key code to get an unknown 7-digit number solution represented by the attack values of the enemy minions

So I wrote some code to give me the output for the first 10000 key vectors (from ( 0 0 0 0 0 0 0 ) to ( 0 0 1 0 0 0 0 ) ) looking for some patterns. It turns out that

some key vectors end up giving the same result. For example, ( 0 0 0 1 3 5 8 ), meaning hitting the fourth minion once, .... and ( 0 0 0 6 3 5 3 ), meaning hitting the fourth minion 6 times both result in the outcome ( 0 0 0 1 1 1 ). Another example would be both ( 0 0 0 3 9 9 3 ) and ( 0 0 0 8 9 9 8 ) leading to ( 0 2 9 7 3 4 2 ). This means that hence there are 10 million possible key vectors and the solution vector does also have seven numbers, but solutions are appearing multiple times
not every solution can be obtained

In fact, by only analysing the first 10000 keys, every single solution that you want to obtain has exactly 2 possible keys. Here is how to retrieve them, given any key:

looking at the 4th digit: If it is 0-4: Add 5. Otherwise (if it is 5-9), substract 5 from this digit
looking at the last (7th) digit: If it is 0-4: Add 5. Otherwise (if it is 5-9), substract 5 from this digit.

This is somewhat similar to the attack changing operations, so I notate this one down as one

zero-change vector: ( 0 0 0 5 0 0 5 )

You can "add" this vector an arbitrary number of times to get another key which results in the same output.

This is a huge discovery, meaning that it takes only half the computation time to solve for every output: Instead of looking for the corresponding output for every single key, you can now only compute all the corresponding keys for outputs which have a number smaller than 5 at their last position (or similarily at their 4th position instead).

But are there any other zero-change vektors? In fact, there is one more which I found through computation. How to computate this? You look at the values given above and search for a vector ( a b c d e f g ) where:

( 1 2 1 8 2 0 7 ) * a

( 8 1 8 8 3 8 8 ) * b

( 0 8 1 1 2 8 8 ) * c

( 0 0 1 1 8 3 7 ) * d = ( 0 0 0 0 0 0 0 )

( 7 0 9 2 1 8 3 ) * e

( 2 3 2 7 0 1 1 ) * f

( 8 8 9 7 0 3 1 ) * g

which are the eigenvectors of the matrix A formed by the attack changing values if this were normal matrix vector multiplication. However, it is not since you need to apply the modulus 10 function in every operation. Our multiplication here works just like normal multiplication, but only looking at the last digit of the result. Working out the math behind this, it ultimitely leads to the second and only other eigenvector, which is

( 2 6 2 4 2 8 0 )

Keeping in mind that we can "multiply" (with the %10 operation) every eigenvector to get all zero-changing vectors, this leeds to these results, n being a natural number:

( 0 0 0 5 0 0 5 ) * n is an element in {( 0 0 0 5 0 0 5 ), ( 0 0 0 0 0 0 0 )}, excluding the 0 vector since it means to not change anything from your key to get another key which leads to the same result
( 2 6 2 4 2 8 0 ) * n is an element in {( 2 6 2 4 2 8 0 ),( 4 2 4 8 4 6 0 ), ( 8 4 8 6 8 2 0 ), ( 6 8 6 2 6 4 0)}
this means that there are 10 different keys which result in the same outcome and these can be obtained by "adding" the vectors above to the keys

So for computating each possible outcome, one must enter only one million keys instead of the previously known 10 million. Also, this is a complete description for optimizing in case a solution is found.

So knowing this I actually computed all possible outcomes by using excel and immediately recognized that my guess to obtain ( 0 0 0 0 0 0 0 ) was wrong since this number cannot be retrieved! The next best thing to guess turned out to be the solution:

there is only one solution where all 7 digits are the same number, which is ( 4 4 4 4 4 4 4 ) and this is obtained by one of these 10 vectors: (and you can attack a minion a multiple of 10 more times to get even more possible answers, so instead of attacking it once you could also attack it 11, 21, 31, ... times)
( 1 2 3 0 0 3 2 )
( 3 8 5 4 2 1 2 )
( 5 4 7 8 4 9 2 )
( 7 0 9 2 6 7 2 )
( 9 6 1 6 8 5 2 )
( 1 2 3 5 0 3 7 )
( 3 8 5 9 2 1 7 )
( 5 4 7 3 4 9 7 )
( 7 0 9 7 6 7 7 )
( 9 6 1 1 8 5 7 )