7

The rogue AI has 3 programs trying to get control of 100 servers. To prevent this, we
need to know how many servers will each program attack.

The programs are ranked from highest to lowest priority: A, B, and C.

Program Rules:

1. Each program will try to avoid being deleted.

2. Each program will want to attack the maximum number of servers possible.

Process Rules:

1. The highest priority program (A) proposes a distribution to attack the servers,
picking how many servers each program attacks. Eg. A -> 40, B -> 30, C -> 30

2. All programs evaluate whether or not this is a suitable distribution.

3. The distribution is approved if at least half of the programs accept it.

4. In case of a tie, the highest priority program decides.

5. If the distribution is accepted, the attack on the server commences.

6. If not, the proposer program is deleted and the next highest priority program makes
a new distribution.

All programs are logical, how many programs will A attack?

1
42
6

CAFE

31 Oct. - 25 Dec. =

4
The rogue AI has downloaded 1000 les into our system, 1 of them contains a virus
that will soon activate, deleting all our data. These les are numbered from 1 to 1000
(1 to 1111101000 in binary)

We have a program that can check as many les at once as needed.

We can run as many instances of the program as needed and each instance can
check as many les as needed as well.

When all the instances of the program nish, all instances of it that had checked the
infected le will ping us, but won’t show which le was infected.

What is the minimum number of instances of our program that we need to run in
order to unequivocally nd the infected le on the rst try?

fi
fi
fi
fi
fi
fi
fi
fi
fi
fi
5

!
2

TRUE
SOLUTIONS:

TASK Decimal Binary

0 1 1

1 21 1 0 1 0 1

2 63 1 1 1 1 1 1

3 0 0

4 10 1 0 1 0

5 24 1 1 0 0 0

6 51966 1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 0

7 99 1 1 0 0 0 1 1

Final binary: 1 1 0 1 0 1 1 1 1 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 0 0 1 0 1 0 1 1 1 1 1 1 1 0 1 1 0 0 0 1 1

KEY CODE: 2 9 6 8 1 1 1 6 3 4 8 2 5 9