You watch a group of words going to a party. A word either enters through one of two doors or is turned away by the guards. ‘HIM’ goes through door number one and ‘BUG’ goes through door number two. ‘HER’ is turned away. ‘MINT’ and ‘WEAVE’ go in through door one, ‘DOOR’ and ‘CORD’ take door two and ‘THIS’ and ‘That’ aren’t allowed in.
What determines whether a word can enter and which door they must use?
Door number one is for words composed entirely of capital letters written using only straight lines, such as A, E, F, H, and I. The entire set of letters allowed through door number one are AEFHIKLMNTVWXYZ. Door number two, as might be expected, is for words with capital letters that have a curve, including BCDGJOPQRSU. Any words composed of both straight and curved letters (or lowercase letters) are not allowed in. The word ‘THAT’ would have been sent through door number one, if the letters had been capitalized.
A man leaves home, turns left, goes straight, turns left again, goes straight and turns left once more then returns home and there’s another man with a mask on. What’s going on?
While driving his car a man slams on the brakes when he sees, in the middle of the street, a diamond studded door, a gold door and a silver door. Which door does he open first?
You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?
I haven’t figured this out yet. Bad apple doesn’t really fit with the lowercase letters. They’re both vowels, but I don’t know if that’s relevant. The fourth one looks kind of like a hill, could it be apple hill?