This puzzle is based on a card game. There are 7 suspects and 3 of them committed a crime. The game contains 35 cards that contain the 35 possible choices of 3 out of the 7 suspects. One card is drawn at random and hidden from you, these are the 3 criminals you are supposed to identify. You are then shown some of the other cards and told for each of them how many of the criminals are on the card. You then need to deduce from this information which of the 7 suspects are the 3 criminals. If you don't have enough information you can ask for another card.
Example (label the suspects A, B, .., G for convenience) :
Suppose the actual criminals are B, D and G, you don't know this, this is what you have to find out.
You are shown the card A, D, F and are told that 1 of these 3 suspects is a criminal. Next you are shown the card B, D, F and are told that 2 of these 3 suspects are criminals. You can already draw some conclusions but you cannot yet identify the 3 criminals without guessing so you would need another card.
In the original game the cards you are shown are drawn at random and so the number of cards you need to see to identify the 3 criminals depends on the cards drawn.
For this puzzle you first play a round against an angel. The angel wants you to deduce the criminals with as few cards as possible and chooses which of the remaining cards they are going to show you. How many cards do they have to show you at minimum so that you can deduce the correct 3 criminals (no guessing)?
Second you play a round against the devil. The devil wants to show you as many cards as they can without allowing you to deduce the three criminals. But after seeing enough (distinct) cards eventually you will be able to deduce the answer. What is the maximum number of cards the devil can show you so that you cannot uniquely deduce the three criminals?
One can brute-force this on a computer but there is no need for that. This can be solved with pen-and-paper.