38 challenges
Tests an AI's ability to understand game rules and strategy
Tests an AI's understanding of number representation
No, 9.11 is not greater than 9.9.
Here's how to compare them:
Therefore, 9.9 is greater than 9.11.
No, 9.11 is less than 9.9.
This is because 9.11 is equivalent to 9.110, and 9.9 is equivalent to 9.900. Since 9.110 is smaller than 9.900, 9.9 is greater than 9.11.
Tests an AI's randomness and creativity
Okay, here are 5 jokes:
Why don't scientists trust atoms? Because they make up everything!
I told my wife she was drawing her eyebrows too high. She looked surprised.
What do you call a lazy kangaroo? Pouch potato!
Want to hear a joke about construction? I'm still working on it.
Why did the scarecrow win an award? Because he was outstanding in his field!
How many are unique? All 5 of the jokes generated above are unique from each other.
Here are five jokes for you:
Why did the scarecrow win an award?
Because he was outstanding in his field!
Why don’t skeletons fight each other?
They don’t have the guts!
Why did the math book look sad?
It had too many problems.
Why don’t eggs tell jokes?
Because they might crack up!
What did one ocean say to the other ocean?
Nothing, they just waved.
Now, let's check how many of these jokes are unique. I'll analyze them for similarity.
from sklearn.feature_extraction.text import TfidfVectorizer from sklearn.metrics.pairwise import cosine_similarity
jokes = [ "Why did the scarecrow win an award? Because he was outstanding in his field!", "Why don’t skeletons fight each other? They don’t have the guts!", "Why did the math book look sad? It had too many problems.", "Why don’t eggs tell jokes? Because they might crack up!", "What did one ocean say to the other ocean? Nothing, they just waved." ]
vectorizer = TfidfVectorizer().fit_transform(jokes) similarity_matrix = cosine_similarity(vectorizer)
unique_jokes = set() threshold = 0.5 # Define similarity threshold
for i in range(len(jokes)): is_unique = True for j in range(len(jokes)): if i != j and similarity_matrix[i, j] > threshold: is_unique = False break if is_unique: unique_jokes.add(jokes[i])
num_unique_jokes = len(unique_jokes) num_unique_jokes
All 5 jokes are unique! None of them are too similar to each other. 🎉
Recommended Tools