I am looking for an old movie, i don't know much about it. All i know is that there was a house and there was a monster who stood in front of the window for so long that his image burned into the window. That's all of my information. I don't saw this movie, one of my friends told me about it few ...

In a table tennis tournament, there are 7 different tables and 10 players. Every player has to play exactly 7 matches (one match at each table). It's not allowed to play twice against the same opponent. Is it possible? If yes, give a solution.

This is IQ type of puzzle. May not be progressive sequence.

This puzzle is part of the Puzzling Stack Exchange Advent Calendar 2023. The accepted answer to this question will be awarded a bounty worth {X} reputation.< Previous Door Next Door > The following words can be paired and each pair associated with two letters. The pairs of letters can be arranged...

There are about 9.266 x 10^25 partitions of 2024, a handful! To each of these petitions corresponds a graph in which the vertices are each of the parts, two of which are joined by an edge if they are not relatively prime (i.e. they have a common factor greater than 1). i) Find a graph such that t...

Everyone who lives on the Island of Careful Thought is either sane (believing all true statements, and no false statements) or insane (believing all false statements, and no true statements). The inhabitants of the island never intentionally lie, but they are either straightforward (able to say s...

A chess position's n-score is defined as: NaN if it's impossible for the position to be played for another n half-moves (assume that the game ends in a draw as soon as the same position is repeated 3 times); Otherwise, the number of possible positions it can have evolved into at the end of n hal...