A mesh connected network consisting of 1 0 × 1 0 computers are arranged as shown. At the start, exactly 9 of these computers are infected with a virus. If any computer is directly connected to at least 2 infected neighbors, it will also become infected.
Will the virus infect all 100 computers (You must consider all 1 0 0 C 9 initial cases)?
Note: This initial starting position shown below is provided as a single example.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Good use of the invariant principle .
Note that the total perimeter of all the viruses is at most 36 at the start. (It could be 12).
How about we put the initial viruses diagonally? I think it will infect all the computers
Log in to reply
Yes, that would work. It requires 10 cells on the diagonal.
I like this puzzle! However in your solution I wish you would have more clearly defined what you mean by "perimeter." In the case of interior nodes it seems to be a count of edges from infected nodes to uninfected ones that are not contained within a closed path of edges between infected nodes, whereas in the case of the fully infected grid (perimeter = 40) it seems to be a count of edges between infected nodes? Or maybe we can define perimeter always in the former way and consider the 10x10 grid as part of a larger network.
It can spread at most to 9*9=81 points as the viruses outermost possible positions without breaking their contact with the group are to spread at 9 wide and 9 long. Because if a virus stand alone (no neighbours at the diamond around it), it cannot infect other healthy computers.
I think this solution assumes that we start with the initial setup in the picture. But, I believe that @Ossama Ismail intended the question to pertain to all possible setups. So, I think the solution needs to be generalized.
Log in to reply
Yes, I understand. I'm just asking for the generalisation because there exists a very nice solution.
A much more interesting question: is it possible if the viruses (9 of them) are arbitrarily placed at the start?
Log in to reply
Yes, and it still won't take, because the worst it could get is 81% infection rate.
Log in to reply
Can you prove this?
Yeah, this can be done with a starting position of (1,1), (2,2), (3,3), (4,4), (5,5), (6,6), (7,7), (8,8), and (9,9)... Too bad we didn't have just one more! ;0)
Log in to reply
@Geoff Pilling – A really hard question that somebody once posed to me was how many ways can it be done if we had 10 viruses instead?
How about we put the initial viruses diagonally? I think it will infect all the computers
I think that (10) is the minimum initial infected computers that's sufficient to initiate a chain reaction that will cause all computers to be infected in the end , and these ten units should be in the diagonal positions which will add another parallel infected line for each iteration till infecting all computers.
Problem Loading...
Note Loading...
Set Loading...
Consider the total perimeter of all viruses. It is at most 36 at the start and is non-increasing (can you see why?).
If all computers were infected at the end, then the perimeter is 40. Thus, there is no way that can happen.