game_name stringclasses 13
values | game_no int64 0 12 | round int64 1 8 | valid bool 2
classes | target stringlengths 3 80 | system stringclasses 13
values | messages listlengths 2 16 | completion stringlengths 0 16.6k | completion_no_think stringlengths 0 1.02k | has_think bool 2
classes | episode int64 0 14k | source stringclasses 14
values |
|---|---|---|---|---|---|---|---|---|---|---|---|
tower | 9 | 1 | true | Tara,Niaj,Kira;2L,3R,1R;11,01,00 | You solve a placement puzzle from feedback.
A tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.
You are shown a proposed placement and, for each person, two flags: whether their FLOOR is correct (✓) or not (... | [
{
"role": "system",
"content": "You solve a placement puzzle from feedback.\n\nA tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.\n\nYou are shown a proposed placement and, for each person, two fl... | <answer>
solution 1:
Tara: floor 2, Left
Niaj: floor 1, Right
Kira: floor 3, Left
</answer> | <answer>
solution 1:
Tara: floor 2, Left
Niaj: floor 1, Right
Kira: floor 3, Left
</answer> | false | 2,174 | tower_sft |
anagram | 3 | 1 | true | conniption,spirochaetaceae | You determine whether two words are anagrams of each other.
Two words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).
Think it through, then give your final answer inside... | [
{
"role": "system",
"content": "You determine whether two words are anagrams of each other.\n\nTwo words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).\n\nThin... | <think>Let me count the letters in each word.
'conniption': c-o-n-n-i-p-t-i-o-n
c: 1
o: 2
n: 3
i: 2
p: 1
t: 1
Total: 10 letters
'spirochaetaceae': s-p-i-r-o-c-h-a-e-t-a-c-e-a-e
s: 1
p: 1
i: 1
r: 1
o: 1
c: 2
h: 1
a: 3
e: 3
t: 1
Total: 15 letters
So "conniption" has 10 letters and "spirochaetaceae" has 15 letters—they... | 'conniption' has 10 letters, while 'spirochaetaceae' has 15 letters. Since they have different lengths, they cannot be anagrams.
<answer>no</answer> | true | 620 | anagram_sft |
codebreaker | 10 | 3 | true | AAFA | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 4=A; in the code but misplaced: none; not in the code: C, D, E. 27 codes still fit; BFBA is one of them, so I'll try it. <guess>BFBA</guess> | Clues so far — fixed: slot 4=A; in the code but misplaced: none; not in the code: C, D, E. 27 codes still fit; BFBA is one of them, so I'll try it. <guess>BFBA</guess> | false | 1,276 | codebreaker_sft |
wordle | 0 | 5 | true | flong | You are an expert Wordle player.
I have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:
✓ correct letter in the correct position
- correct letter but in the wrong position
x the letter is not in the secret word at all
Rules:
- Each guess must be... | [
{
"role": "system",
"content": "You are an expert Wordle player.\n\nI have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:\n ✓ correct letter in the correct position\n - correct letter but in the wrong position\n x the letter is not in th... | <think>Letters: position 2=L, 3=O, 4=N, no B,D,K,P,S,I,C,R,A,E
L is in position 2, O in position 3, N in position 4.
_LON_
Need letters not used: not B,D,K,P,S,I,C,R,A,E
From "lions": L is -, so L is in word but not position 1. It's in position 2 now ✓.
Testing words with the pattern _LON_: ALONG has A which is ruled... | Letters confirmed: position 2=L, 3=O, 4=N. Excluded: C,R,A,E,I,S,B,D,K,P.
FLONG (a printing term): F-L-O-N-G fits perfectly.
<guess>flong</guess> | true | 119 | batch_low_sft |
bullscows | 11 | 2 | true | 5093 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (2480 → 0 bulls, 1 cow), 1440 numbers still fit every count; 3816 is one of them, so I'll try it. <guess>3816</guess> | From the clues so far (2480 → 0 bulls, 1 cow), 1440 numbers still fit every count; 3816 is one of them, so I'll try it. <guess>3816</guess> | false | 820 | bullscows_sft |
validity | 2 | 1 | true | loimbi | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 2,433 | validity_sft |
validity | 2 | 1 | true | dant | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 8,704 | validity_sft |
charcount | 1 | 1 | true | ylike | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (2): I E
consonants (3): Y L K
</answer> | <answer>
length: 5
vowels (2): I E
consonants (3): Y L K
</answer> | false | 3,200 | charcount_sft |
charcount | 1 | 1 | true | periodically | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 12
vowels (5): E I O I A
consonants (7): P R D C L L Y
</answer> | <answer>
length: 12
vowels (5): E I O I A
consonants (7): P R D C L L Y
</answer> | false | 2,561 | charcount_sft |
tower | 9 | 1 | true | Elena,Uma,Will;3R,1L,2R;11,00,01 | You solve a placement puzzle from feedback.
A tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.
You are shown a proposed placement and, for each person, two flags: whether their FLOOR is correct (✓) or not (... | [
{
"role": "system",
"content": "You solve a placement puzzle from feedback.\n\nA tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.\n\nYou are shown a proposed placement and, for each person, two fl... | <answer>
solution 1:
Elena: floor 3, Right
Uma: floor 2, Right
Will: floor 1, Right
</answer> | <answer>
solution 1:
Elena: floor 3, Right
Uma: floor 2, Right
Will: floor 1, Right
</answer> | false | 1,190 | tower_sft |
charset | 7 | 1 | true | exhibitioner,adapt | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (12): A B D E H I N O P R T X
unused (14): C F G J K L M Q S U V W Y Z
</answer> | <answer>
used (12): A B D E H I N O P R T X
unused (14): C F G J K L M Q S U V W Y Z
</answer> | false | 8,568 | charset_sft |
bullscows | 11 | 3 | true | 4236 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (3705 → 0 bulls, 1 cow; 4392 → 1 bull, 2 cows), 83 numbers still fit every count; 1324 is one of them, so I'll try it. <guess>1324</guess> | From the clues so far (3705 → 0 bulls, 1 cow; 4392 → 1 bull, 2 cows), 83 numbers still fit every count; 1324 is one of them, so I'll try it. <guess>1324</guess> | false | 1,205 | bullscows_sft |
bullscows | 11 | 2 | true | 6930 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (6193 → 1 bull, 2 cows), 216 numbers still fit every count; 1692 is one of them, so I'll try it. <guess>1692</guess> | From the clues so far (6193 → 1 bull, 2 cows), 216 numbers still fit every count; 1692 is one of them, so I'll try it. <guess>1692</guess> | false | 1,550 | bullscows_sft |
anagram | 3 | 1 | true | arecidae,parented | You determine whether two words are anagrams of each other.
Two words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).
Think it through, then give your final answer inside... | [
{
"role": "system",
"content": "You determine whether two words are anagrams of each other.\n\nTwo words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).\n\nThin... | <think>Let me check if 'arecidae' and 'parented' are anagrams.
'arecidae': a, r, e, c, i, d, a, e → 8 letters
a(2), r(1), e(2), c(1), i(1), d(1)
'parented': p, a, r, e, n, t, e, d → 8 letters
p(1), a(1), r(1), e(2), n(1), t(1), d(1)
These have different letters (arecidae has c and i but no p, n, t; parented has p, n... | **'arecidae'**: a, r, e, c, i, d, a, e → a(2), r(1), e(2), c(1), i(1), d(1)
**'parented'**: p, a, r, e, n, t, e, d → p(1), a(1), r(1), e(2), n(1), t(1), d(1)
The letters don't match — 'arecidae' contains **c** and **i** (and an extra **a**) while 'parented' contains **p**, **n**, and **t**, which are absent in 'areci... | true | 938 | anagram_sft |
charcount | 1 | 1 | true | screw | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (1): E
consonants (4): S C R W
</answer> | <answer>
length: 5
vowels (1): E
consonants (4): S C R W
</answer> | false | 2,473 | charcount_sft |
validity | 2 | 1 | true | folie | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>valid</answer>
<meaning>(psychiatry) a psychological disorder of thought or emotion; a more neutral term than mental illness</meaning> | <answer>valid</answer>
<meaning>(psychiatry) a psychological disorder of thought or emotion; a more neutral term than mental illness</meaning> | false | 1,100 | validity_sft |
validity | 2 | 1 | true | dural | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>valid</answer>
<meaning>of or relating to the dura mater</meaning> | <answer>valid</answer>
<meaning>of or relating to the dura mater</meaning> | false | 12,868 | validity_sft |
charcount | 1 | 1 | true | poser | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (2): O E
consonants (3): P S R
</answer> | <answer>
length: 5
vowels (2): O E
consonants (3): P S R
</answer> | false | 6,255 | charcount_sft |
wordle | 0 | 5 | true | mamba | You are an expert Wordle player.
I have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:
✓ correct letter in the correct position
- correct letter but in the wrong position
x the letter is not in the secret word at all
Rules:
- Each guess must be... | [
{
"role": "system",
"content": "You are an expert Wordle player.\n\nI have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:\n ✓ correct letter in the correct position\n - correct letter but in the wrong position\n x the letter is not in th... | <think>Letters known:
- Position 2: A
- 'A' is in position 2 ✓
- 'B' is in the word but not position 1
- 'L' not in word
- 'M' not in word (wait, M is -)... M is in word but not position 4
- 'S' not in word
Letters not in word: C, R, N, E, F, I, T, H, G, U, D, Y, L, S
So I need a word with A in position 2, B somewhere... | <guess>mambo</guess> | true | 50 | batch_low_sft |
rhyme | 5 | 1 | true | agglomeration | You are a rhyming expert. You are given an English word.
- If a list of options is provided, choose the single option that rhymes with the word.
- Otherwise, name any common English word that rhymes with the given word.
Two words rhyme when they share the same ending sound (from the last stressed vowel onward), like ... | [
{
"role": "system",
"content": "You are a rhyming expert. You are given an English word.\n\n- If a list of options is provided, choose the single option that rhymes with the word.\n- Otherwise, name any common English word that rhymes with the given word.\n\nTwo words rhyme when they share the same ending s... | <answer>mediation</answer> | <answer>mediation</answer> | false | 2,599 | rhyme_sft |
charcount | 1 | 1 | true | sempiternity | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 12
vowels (4): E I E I
consonants (8): S M P T R N T Y
</answer> | <answer>
length: 12
vowels (4): E I E I
consonants (8): S M P T R N T Y
</answer> | false | 1,732 | charcount_sft |
endstart | 4 | 1 | true | tussle;homogenised,cardi,underlay,eolithic,mailing | You are given a word and five candidate words.
Choose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.
Give your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.
Output the <answer> tag exactly once, as the very last thing ... | [
{
"role": "system",
"content": "You are given a word and five candidate words.\n\nChoose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.\n\nGive your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.\nOutput the <... | <answer>eolithic</answer> | <answer>eolithic</answer> | false | 2,236 | endstart_sft |
charcount | 1 | 1 | true | stang | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (1): A
consonants (4): S T N G
</answer> | <answer>
length: 5
vowels (1): A
consonants (4): S T N G
</answer> | false | 2,035 | charcount_sft |
charset | 7 | 1 | true | strum,sigmoidectomy,agamic | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (13): A C D E G I M O R S T U Y
unused (13): B F H J K L N P Q V W X Z
</answer> | <answer>
used (13): A C D E G I M O R S T U Y
unused (13): B F H J K L N P Q V W X Z
</answer> | false | 880 | charset_sft |
wordle | 0 | 6 | true | oucht | You are an expert Wordle player.
I have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:
✓ correct letter in the correct position
- correct letter but in the wrong position
x the letter is not in the secret word at all
Rules:
- Each guess must be... | [
{
"role": "system",
"content": "You are an expert Wordle player.\n\nI have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:\n ✓ correct letter in the correct position\n - correct letter but in the wrong position\n x the letter is not in th... | <think>Let me analyze the clues carefully:
From CRANE: C-, R=x, A=x, N=x, E=x
From CLOUT: C-, L=x, O-, U=x, T=✓
From PICOT: P=x, I=x, C=✓(position 3), O-, T=✓(position 5)
So:
- Position 3: C
- Position 5: T
- Letters in word: C (somewhere), O (somewhere but not position 3 or 4... wait)
- Actually, let me reconsider t... | true | 58 | batch_high_sft | |
consistency | 12 | 1 | true | EISEL:xxyxx;TRAYS | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were TRAYS, guessing EISEL would score x x - x x, which matches the clue. Every clue is satisfied, so TRAYS is still possible.
<answer>yes</answer> | If the word were TRAYS, guessing EISEL would score x x - x x, which matches the clue. Every clue is satisfied, so TRAYS is still possible.
<answer>yes</answer> | false | 1,585 | consistency_sft |
bullscows | 11 | 3 | true | 0895 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (0284 → 1 bull, 1 cow; 5680 → 0 bulls, 3 cows), 41 numbers still fit every count; 0518 is one of them, so I'll try it. <guess>0518</guess> | From the clues so far (0284 → 1 bull, 1 cow; 5680 → 0 bulls, 3 cows), 41 numbers still fit every count; 0518 is one of them, so I'll try it. <guess>0518</guess> | false | 999 | bullscows_sft |
tower | 9 | 1 | true | Omar,Yara,Hana;3R,2L,1L;01,01,00 | You solve a placement puzzle from feedback.
A tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.
You are shown a proposed placement and, for each person, two flags: whether their FLOOR is correct (✓) or not (... | [
{
"role": "system",
"content": "You solve a placement puzzle from feedback.\n\nA tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.\n\nYou are shown a proposed placement and, for each person, two fl... | <answer>
solution 1:
Omar: floor 1, Right
Yara: floor 3, Left
Hana: floor 2, Right
solution 2:
Omar: floor 2, Right
Yara: floor 1, Left
Hana: floor 3, Right
</answer> | <answer>
solution 1:
Omar: floor 1, Right
Yara: floor 3, Left
Hana: floor 2, Right
solution 2:
Omar: floor 2, Right
Yara: floor 1, Left
Hana: floor 3, Right
</answer> | false | 3,918 | tower_sft |
bullscows | 11 | 3 | true | 6743 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (3679 → 0 bulls, 3 cows; 6987 → 1 bull, 1 cow), 60 numbers still fit every count; 5367 is one of them, so I'll try it. <guess>5367</guess> | From the clues so far (3679 → 0 bulls, 3 cows; 6987 → 1 bull, 1 cow), 60 numbers still fit every count; 5367 is one of them, so I'll try it. <guess>5367</guess> | false | 590 | bullscows_sft |
bullscows | 11 | 1 | true | 0581 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | No clues yet, so I'll open with 6871. <guess>6871</guess> | No clues yet, so I'll open with 6871. <guess>6871</guess> | false | 149 | bullscows_sft |
codebreaker | 10 | 1 | true | EDDE | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | No feedback yet, so I'll open with ACEB. <guess>ACEB</guess> | No feedback yet, so I'll open with ACEB. <guess>ACEB</guess> | false | 2,492 | codebreaker_sft |
charcount | 1 | 1 | true | pinks | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (1): I
consonants (4): P N K S
</answer> | <answer>
length: 5
vowels (1): I
consonants (4): P N K S
</answer> | false | 6,853 | charcount_sft |
endstart | 4 | 1 | true | exoticness;magnoliophyta,spado,knurr,totemist,indochina | You are given a word and five candidate words.
Choose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.
Give your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.
Output the <answer> tag exactly once, as the very last thing ... | [
{
"role": "system",
"content": "You are given a word and five candidate words.\n\nChoose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.\n\nGive your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.\nOutput the <... | <answer>spado</answer> | <answer>spado</answer> | false | 2,517 | endstart_sft |
consistency | 12 | 1 | true | THYME:xxxxx|DARKS:xyxxy;SPINA | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were SPINA, guessing THYME would score x x x x x, which matches the clue. If the word were SPINA, guessing DARKS would score x - x x -, which matches the clue. Every clue is satisfied, so SPINA is still possible.
<answer>yes</answer> | If the word were SPINA, guessing THYME would score x x x x x, which matches the clue. If the word were SPINA, guessing DARKS would score x - x x -, which matches the clue. Every clue is satisfied, so SPINA is still possible.
<answer>yes</answer> | false | 5,042 | consistency_sft |
validity | 2 | 1 | true | diner | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>valid</answer>
<meaning>a person eating a meal (especially in a restaurant)</meaning> | <answer>valid</answer>
<meaning>a person eating a meal (especially in a restaurant)</meaning> | false | 4,688 | validity_sft |
rhyme | 5 | 1 | true | albino | You are a rhyming expert. You are given an English word.
- If a list of options is provided, choose the single option that rhymes with the word.
- Otherwise, name any common English word that rhymes with the given word.
Two words rhyme when they share the same ending sound (from the last stressed vowel onward), like ... | [
{
"role": "system",
"content": "You are a rhyming expert. You are given an English word.\n\n- If a list of options is provided, choose the single option that rhymes with the word.\n- Otherwise, name any common English word that rhymes with the given word.\n\nTwo words rhyme when they share the same ending s... | <answer>ludo</answer> | <answer>ludo</answer> | false | 2,645 | rhyme_sft |
wordle | 0 | 3 | true | emeer | You are an expert Wordle player.
I have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:
✓ correct letter in the correct position
- correct letter but in the wrong position
x the letter is not in the secret word at all
Rules:
- Each guess must be... | [
{
"role": "system",
"content": "You are an expert Wordle player.\n\nI have chosen a secret 5-letter English word. You have 6 guesses to find it. After each guess, every letter is scored:\n ✓ correct letter in the correct position\n - correct letter but in the wrong position\n x the letter is not in th... | <think>Letters: E in position 4 ✓, R in position 5 ✓
R is in word but not position 2 (from crane), E not position 5 (from crane)
x letters: C, A, N, O, U, T
Need word: _ _ _ E R
No C, A, N, O, U, T
R somewhere... R is in position 5 already confirmed.
Word: _ _ _ E R
No C, A, N, O, U, T
DIVER? D-I-V-E-R ✓</think>
<g... | <guess>diver</guess> | true | 329 | batch_low_sft |
charcount | 1 | 1 | true | sitar | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (2): I A
consonants (3): S T R
</answer> | <answer>
length: 5
vowels (2): I A
consonants (3): S T R
</answer> | false | 10,939 | charcount_sft |
validity | 2 | 1 | true | feak | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 8,448 | validity_sft |
anagram | 3 | 1 | true | droob,boord | You determine whether two words are anagrams of each other.
Two words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).
Think it through, then give your final answer inside... | [
{
"role": "system",
"content": "You determine whether two words are anagrams of each other.\n\nTwo words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).\n\nThin... | <think>droob: d, r, o, o, b
boord: b, o, o, r, d
Both have the same letters: b, d, o, o, r. Yes, they are anagrams.</think>
Both words contain the letters: b, d, o, o, r — the same letters, same counts.
<answer>yes</answer> | Both words contain the letters: b, d, o, o, r — the same letters, same counts.
<answer>yes</answer> | true | 197 | anagram_sft |
endstart | 4 | 1 | true | driveway;hypothermia,yawny,couple,quins,kurdish | You are given a word and five candidate words.
Choose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.
Give your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.
Output the <answer> tag exactly once, as the very last thing ... | [
{
"role": "system",
"content": "You are given a word and five candidate words.\n\nChoose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.\n\nGive your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.\nOutput the <... | <answer>yawny</answer> | <answer>yawny</answer> | false | 1,518 | endstart_sft |
codebreaker | 10 | 4 | true | BBAE | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 1=B, slot 3=A; in the code but misplaced: E; not in the code: C, D, F. 1 codes still fit; BBAE is one of them, so I'll try it. <guess>BBAE</guess> | Clues so far — fixed: slot 1=B, slot 3=A; in the code but misplaced: E; not in the code: C, D, F. 1 codes still fit; BBAE is one of them, so I'll try it. <guess>BBAE</guess> | false | 517 | codebreaker_sft |
charset | 7 | 1 | true | gilgamish,tenes | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (10): A E G H I L M N S T
unused (16): B C D F J K O P Q R U V W X Y Z
</answer> | <answer>
used (10): A E G H I L M N S T
unused (16): B C D F J K O P Q R U V W X Y Z
</answer> | false | 7,814 | charset_sft |
validity | 2 | 1 | true | about | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>valid</answer>
<meaning>on the move</meaning> | <answer>valid</answer>
<meaning>on the move</meaning> | false | 1,042 | validity_sft |
validity | 2 | 1 | true | gamed | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>valid</answer>
<meaning>place a bet on</meaning> | <answer>valid</answer>
<meaning>place a bet on</meaning> | false | 9,073 | validity_sft |
tower | 9 | 1 | true | Linda,Dave,Victor;3L,2R,1L;11,00,00 | You solve a placement puzzle from feedback.
A tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.
You are shown a proposed placement and, for each person, two flags: whether their FLOOR is correct (✓) or not (... | [
{
"role": "system",
"content": "You solve a placement puzzle from feedback.\n\nA tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.\n\nYou are shown a proposed placement and, for each person, two fl... | <answer>
solution 1:
Linda: floor 3, Left
Dave: floor 1, Left
Victor: floor 2, Right
</answer> | <answer>
solution 1:
Linda: floor 3, Left
Dave: floor 1, Left
Victor: floor 2, Right
</answer> | false | 3,311 | tower_sft |
charset | 7 | 1 | true | compactly,chitin,weber,robustious | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (17): A B C E H I L M N O P R S T U W Y
unused (9): D F G J K Q V X Z
</answer> | <answer>
used (17): A B C E H I L M N O P R S T U W Y
unused (9): D F G J K Q V X Z
</answer> | false | 3,740 | charset_sft |
endstart | 4 | 1 | true | argos;zoophagous,xanthate,bayberry,jehad,sevens | You are given a word and five candidate words.
Choose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.
Give your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.
Output the <answer> tag exactly once, as the very last thing ... | [
{
"role": "system",
"content": "You are given a word and five candidate words.\n\nChoose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.\n\nGive your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.\nOutput the <... | <answer>sevens</answer> | <answer>sevens</answer> | false | 1,035 | endstart_sft |
codebreaker | 10 | 2 | true | CBDF | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 2=B, slot 4=F; in the code but misplaced: none; not in the code: A. 16 codes still fit; CBFF is one of them, so I'll try it. <guess>CBFF</guess> | Clues so far — fixed: slot 2=B, slot 4=F; in the code but misplaced: none; not in the code: A. 16 codes still fit; CBFF is one of them, so I'll try it. <guess>CBFF</guess> | false | 782 | codebreaker_sft |
codebreaker | 10 | 5 | true | DBBD | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 2=B, slot 3=B, slot 4=D; in the code but misplaced: none; not in the code: A, C, E, F. 1 codes still fit; DBBD is one of them, so I'll try it. <guess>DBBD</guess> | Clues so far — fixed: slot 2=B, slot 3=B, slot 4=D; in the code but misplaced: none; not in the code: A, C, E, F. 1 codes still fit; DBBD is one of them, so I'll try it. <guess>DBBD</guess> | false | 612 | codebreaker_sft |
bullscows | 11 | 3 | true | 5371 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (8972 → 1 bull, 0 cows; 4576 → 1 bull, 1 cow), 90 numbers still fit every count; 8541 is one of them, so I'll try it. <guess>8541</guess> | From the clues so far (8972 → 1 bull, 0 cows; 4576 → 1 bull, 1 cow), 90 numbers still fit every count; 8541 is one of them, so I'll try it. <guess>8541</guess> | false | 942 | bullscows_sft |
charset | 7 | 1 | true | exhortation,pierrot,taros | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (11): A E H I N O P R S T X
unused (15): B C D F G J K L M Q U V W Y Z
</answer> | <answer>
used (11): A E H I N O P R S T X
unused (15): B C D F G J K L M Q U V W Y Z
</answer> | false | 526 | charset_sft |
charcount | 1 | 1 | true | chair | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 5
vowels (2): A I
consonants (3): C H R
</answer> | <answer>
length: 5
vowels (2): A I
consonants (3): C H R
</answer> | false | 4,233 | charcount_sft |
anagram | 3 | 1 | true | cental,lancet | You determine whether two words are anagrams of each other.
Two words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).
Think it through, then give your final answer inside... | [
{
"role": "system",
"content": "You determine whether two words are anagrams of each other.\n\nTwo words are anagrams if one can be formed by rearranging all the letters of the other: they contain exactly the same letters, each used the same number of times (and so they always have the same length).\n\nThin... | <think>cental: c, e, n, t, a, l
lancet: l, a, n, c, e, t
Both have the same letters: a, c, e, l, n, t. Yes, they are anagrams.</think>
Both words contain the letters: a, c, e, l, n, t — all six letters match exactly.
<answer>yes</answer> | Both words contain the letters: a, c, e, l, n, t — all six letters match exactly.
<answer>yes</answer> | true | 8 | anagram_sft |
charcount | 1 | 1 | true | enfranchise | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 11
vowels (4): E A I E
consonants (7): N F R N C H S
</answer> | <answer>
length: 11
vowels (4): E A I E
consonants (7): N F R N C H S
</answer> | false | 10,873 | charcount_sft |
endstart | 4 | 1 | true | belladonna;nipponese,arranger,vetchling,panicum,beedi | You are given a word and five candidate words.
Choose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.
Give your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.
Output the <answer> tag exactly once, as the very last thing ... | [
{
"role": "system",
"content": "You are given a word and five candidate words.\n\nChoose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.\n\nGive your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.\nOutput the <... | <answer>arranger</answer> | <answer>arranger</answer> | false | 5,100 | endstart_sft |
validity | 2 | 1 | true | glanc | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 12,305 | validity_sft |
charset | 7 | 1 | true | complacent,haver | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (12): A C E H L M N O P R T V
unused (14): B D F G I J K Q S U W X Y Z
</answer> | <answer>
used (12): A C E H L M N O P R T V
unused (14): B D F G I J K Q S U W X Y Z
</answer> | false | 2,575 | charset_sft |
codebreaker | 10 | 3 | true | AEFC | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 2=E, slot 4=C; in the code but misplaced: A, F; not in the code: D. 1 codes still fit; AEFC is one of them, so I'll try it. <guess>AEFC</guess> | Clues so far — fixed: slot 2=E, slot 4=C; in the code but misplaced: A, F; not in the code: D. 1 codes still fit; AEFC is one of them, so I'll try it. <guess>AEFC</guess> | false | 2,473 | codebreaker_sft |
validity | 2 | 1 | true | uled | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 95 | validity_sft |
charcount | 1 | 1 | true | iud | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 3
vowels (2): I U
consonants (1): D
</answer> | <answer>
length: 3
vowels (2): I U
consonants (1): D
</answer> | false | 12,536 | charcount_sft |
consistency | 12 | 1 | true | COREY:xxxyx|TRONE:xxxxg|DOMED:xxxyx;BASSE | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were BASSE, guessing COREY would score x x x - x, which matches the clue. If the word were BASSE, guessing TRONE would score x x x x ✓, which matches the clue. If the word were BASSE, guessing DOMED would score x x x - x, which matches the clue. Every clue is satisfied, so BASSE is still possible.
<answer>y... | If the word were BASSE, guessing COREY would score x x x - x, which matches the clue. If the word were BASSE, guessing TRONE would score x x x x ✓, which matches the clue. If the word were BASSE, guessing DOMED would score x x x - x, which matches the clue. Every clue is satisfied, so BASSE is still possible.
<answer>y... | false | 4,884 | consistency_sft |
validity | 2 | 1 | true | hady | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 98 | validity_sft |
endstart | 4 | 1 | true | whatchamacallum;plasmacytoma,halls,jubilance,maturate,atomiser | You are given a word and five candidate words.
Choose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.
Give your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.
Output the <answer> tag exactly once, as the very last thing ... | [
{
"role": "system",
"content": "You are given a word and five candidate words.\n\nChoose the single candidate whose FIRST letter is the same as the LAST letter of the given word. Exactly one candidate matches.\n\nGive your final answer inside a single <answer> tag, e.g. <answer>oasis</answer>.\nOutput the <... | <answer>maturate</answer> | <answer>maturate</answer> | false | 3,866 | endstart_sft |
codebreaker | 10 | 1 | true | FEEB | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | No feedback yet, so I'll open with DCBA. <guess>DCBA</guess> | No feedback yet, so I'll open with DCBA. <guess>DCBA</guess> | false | 2,724 | codebreaker_sft |
charcount | 1 | 1 | true | ccrc | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 4
vowels (0): -
consonants (4): C C R C
</answer> | <answer>
length: 4
vowels (0): -
consonants (4): C C R C
</answer> | false | 6,735 | charcount_sft |
consistency | 12 | 1 | true | KAWAS:xxxxx|MEKKA:xxxxx|ORGUE:yxxxx;VODDY | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were VODDY, guessing KAWAS would score x x x x x, which matches the clue. If the word were VODDY, guessing MEKKA would score x x x x x, which matches the clue. If the word were VODDY, guessing ORGUE would score - x x x x, which matches the clue. Every clue is satisfied, so VODDY is still possible.
<answer>y... | If the word were VODDY, guessing KAWAS would score x x x x x, which matches the clue. If the word were VODDY, guessing MEKKA would score x x x x x, which matches the clue. If the word were VODDY, guessing ORGUE would score - x x x x, which matches the clue. Every clue is satisfied, so VODDY is still possible.
<answer>y... | false | 6,698 | consistency_sft |
rhyme | 5 | 1 | true | fancier | You are a rhyming expert. You are given an English word.
- If a list of options is provided, choose the single option that rhymes with the word.
- Otherwise, name any common English word that rhymes with the given word.
Two words rhyme when they share the same ending sound (from the last stressed vowel onward), like ... | [
{
"role": "system",
"content": "You are a rhyming expert. You are given an English word.\n\n- If a list of options is provided, choose the single option that rhymes with the word.\n- Otherwise, name any common English word that rhymes with the given word.\n\nTwo words rhyme when they share the same ending s... | <answer>ransier</answer> | <answer>ransier</answer> | false | 1,257 | rhyme_sft |
crossword | 6 | 1 | true | unselfish | You solve a crossword clue.
You are given a definition, the word's length, and a pattern. In the pattern, revealed letters are shown and hidden letters are written as '_'. Find the single English word that:
- has exactly the given length,
- matches every revealed letter in its position, and
- means what the defi... | [
{
"role": "system",
"content": "You solve a crossword clue.\n\nYou are given a definition, the word's length, and a pattern. In the pattern, revealed letters are shown and hidden letters are written as '_'. Find the single English word that:\n - has exactly the given length,\n - matches every revealed let... | <think>The definition is "disregarding your own advantages and welfare over those of others" - this means selfless or unselfish.
Length: 9
Pattern: _ n s _ l _ _ s h
Let me think: _ n s _ l _ _ s h
"unselfish" - u n s e l f i s h - that's 9 letters!
u-n-s-e-l-f-i-s-h
Pattern: _ n s _ l _ _ s h
Perfect match!</think... | Looking at the pattern `_ n s _ l _ _ s h` with 9 letters and the definition about disregarding one's own advantages for others...
The word is **unselfish**: u-n-s-e-l-f-i-s-h
This fits the pattern perfectly: `u n s e l f i s h`
<answer>unselfish</answer> | true | 747 | crossword_sft |
charset | 7 | 1 | true | hahn,flock,pharmacologically,dauntlessly | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (19): A C D E F G H I K L M N O P R S T U Y
unused (7): B J Q V W X Z
</answer> | <answer>
used (19): A C D E F G H I K L M N O P R S T U Y
unused (7): B J Q V W X Z
</answer> | false | 7,407 | charset_sft |
tower | 9 | 1 | true | Liam,Alice,Wendy;2R,3R,1L;00,00,11 | You solve a placement puzzle from feedback.
A tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.
You are shown a proposed placement and, for each person, two flags: whether their FLOOR is correct (✓) or not (... | [
{
"role": "system",
"content": "You solve a placement puzzle from feedback.\n\nA tower has 3 floors (1 = bottom, 3 = top); each floor has two rooms, Left and Right. Three people each live in a different room, and no two people share a floor.\n\nYou are shown a proposed placement and, for each person, two fl... | <answer>
solution 1:
Liam: floor 3, Left
Alice: floor 2, Left
Wendy: floor 1, Left
</answer> | <answer>
solution 1:
Liam: floor 3, Left
Alice: floor 2, Left
Wendy: floor 1, Left
</answer> | false | 2,696 | tower_sft |
rhyme | 5 | 1 | true | sceptre | You are a rhyming expert. You are given an English word.
- If a list of options is provided, choose the single option that rhymes with the word.
- Otherwise, name any common English word that rhymes with the given word.
Two words rhyme when they share the same ending sound (from the last stressed vowel onward), like ... | [
{
"role": "system",
"content": "You are a rhyming expert. You are given an English word.\n\n- If a list of options is provided, choose the single option that rhymes with the word.\n- Otherwise, name any common English word that rhymes with the given word.\n\nTwo words rhyme when they share the same ending s... | <answer>septer</answer> | <answer>septer</answer> | false | 3,941 | rhyme_sft |
consistency | 12 | 1 | true | BOXER:xgxxx;POLIO | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were POLIO, guessing BOXER would score x ✓ x x x, which matches the clue. Every clue is satisfied, so POLIO is still possible.
<answer>yes</answer> | If the word were POLIO, guessing BOXER would score x ✓ x x x, which matches the clue. Every clue is satisfied, so POLIO is still possible.
<answer>yes</answer> | false | 6,847 | consistency_sft |
charset | 7 | 1 | true | noumenon,trigs | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (10): E G I M N O R S T U
unused (16): A B C D F H J K L P Q V W X Y Z
</answer> | <answer>
used (10): E G I M N O R S T U
unused (16): A B C D F H J K L P Q V W X Y Z
</answer> | false | 6,168 | charset_sft |
charcount | 1 | 1 | true | nondenominational | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 17
vowels (8): O E O I A I O A
consonants (9): N N D N M N T N L
</answer> | <answer>
length: 17
vowels (8): O E O I A I O A
consonants (9): N N D N M N T N L
</answer> | false | 11,281 | charcount_sft |
codebreaker | 10 | 2 | true | BCFE | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 3=F, slot 4=E; in the code but misplaced: none; not in the code: D. 16 codes still fit; CBFE is one of them, so I'll try it. <guess>CBFE</guess> | Clues so far — fixed: slot 3=F, slot 4=E; in the code but misplaced: none; not in the code: D. 16 codes still fit; CBFE is one of them, so I'll try it. <guess>CBFE</guess> | false | 511 | codebreaker_sft |
charcount | 1 | 1 | true | mountaineering | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 14
vowels (7): O U A I E E I
consonants (7): M N T N R N G
</answer> | <answer>
length: 14
vowels (7): O U A I E E I
consonants (7): M N T N R N G
</answer> | false | 12,436 | charcount_sft |
consistency | 12 | 1 | true | SMITS:xxxxx|COONS:xgxxx;DOVED | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were DOVED, guessing SMITS would score x x x x x, which matches the clue. If the word were DOVED, guessing COONS would score x ✓ x x x, which matches the clue. Every clue is satisfied, so DOVED is still possible.
<answer>yes</answer> | If the word were DOVED, guessing SMITS would score x x x x x, which matches the clue. If the word were DOVED, guessing COONS would score x ✓ x x x, which matches the clue. Every clue is satisfied, so DOVED is still possible.
<answer>yes</answer> | false | 182 | consistency_sft |
codebreaker | 10 | 2 | true | ABAC | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 2=B, slot 3=A; in the code but misplaced: none; not in the code: none. 4 codes still fit; ABAD is one of them, so I'll try it. <guess>ABAD</guess> | Clues so far — fixed: slot 2=B, slot 3=A; in the code but misplaced: none; not in the code: none. 4 codes still fit; ABAD is one of them, so I'll try it. <guess>ABAD</guess> | false | 692 | codebreaker_sft |
validity | 2 | 1 | true | muggyd | You judge whether a string is a real English word, and if so, give its meaning.
You are given one string. Decide:
- 'valid' if it is a real English word, or
- 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).
Rules:
- If the word is valid, also give a short, accurate definition of it.... | [
{
"role": "system",
"content": "You judge whether a string is a real English word, and if so, give its meaning.\n\nYou are given one string. Decide:\n - 'valid' if it is a real English word, or\n - 'invalid' if it is not a real word (e.g. a misspelling or a made-up string).\n\nRules:\n- If the word is v... | <answer>invalid</answer> | <answer>invalid</answer> | false | 7,202 | validity_sft |
consistency | 12 | 1 | true | TALAQ:ggxxx|PRUDE:xxxxx;RAILE | You are checking whether a candidate word is still possible in a game of Wordle.
You are shown the clues so far — past guesses, each scored per letter:
✓ the letter is correct and in the right position
- the letter is in the word but in the wrong position
x the letter is not in the word
A candidate word is P... | [
{
"role": "system",
"content": "You are checking whether a candidate word is still possible in a game of Wordle.\n\nYou are shown the clues so far — past guesses, each scored per letter:\n ✓ the letter is correct and in the right position\n - the letter is in the word but in the wrong position\n x the... | If the word were RAILE, guessing TALAQ would score x ✓ - x x, but the clue shows ✓ ✓ x x x: position 1 must be T, but RAILE has R there. So RAILE is ruled out.
<answer>no</answer> | If the word were RAILE, guessing TALAQ would score x ✓ - x x, but the clue shows ✓ ✓ x x x: position 1 must be T, but RAILE has R there. So RAILE is ruled out.
<answer>no</answer> | false | 1,921 | consistency_sft |
codebreaker | 10 | 3 | true | ACDC | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | Clues so far — fixed: slot 1=A, slot 4=C; in the code but misplaced: D; not in the code: B, E, F. 1 codes still fit; ACDC is one of them, so I'll try it. <guess>ACDC</guess> | Clues so far — fixed: slot 1=A, slot 4=C; in the code but misplaced: D; not in the code: B, E, F. 1 codes still fit; ACDC is one of them, so I'll try it. <guess>ACDC</guess> | false | 1,845 | codebreaker_sft |
charset | 7 | 1 | true | bonza,cornmeal | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (10): A B C E L M N O R Z
unused (16): D F G H I J K P Q S T U V W X Y
</answer> | <answer>
used (10): A B C E L M N O R Z
unused (16): D F G H I J K P Q S T U V W X Y
</answer> | false | 5,208 | charset_sft |
charcount | 1 | 1 | true | imperturbability | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 16
vowels (6): I E U A I I
consonants (10): M P R T R B B L T Y
</answer> | <answer>
length: 16
vowels (6): I E U A I I
consonants (10): M P R T R B B L T Y
</answer> | false | 3,376 | charcount_sft |
codebreaker | 10 | 1 | true | BBAE | You are cracking a secret code.
The code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:
✓ right symbol in the right slot
- right symbol but in the wrong slot
x the symbol is not in the code (or all its copies are already accounted for)
Use every c... | [
{
"role": "system",
"content": "You are cracking a secret code.\n\nThe code has 4 slots, each one of 6 symbols (A B C D E F); symbols can repeat. After each guess every slot is scored:\n ✓ right symbol in the right slot\n - right symbol but in the wrong slot\n x the symbol is not in the code (or all i... | No feedback yet, so I'll open with DAFE. <guess>DAFE</guess> | No feedback yet, so I'll open with DAFE. <guess>DAFE</guess> | false | 24 | codebreaker_sft |
charset | 7 | 1 | true | fruitfulness,boron | You track which letters of the alphabet a set of words uses.
You are given a few English words. Considering all of them together, report:
- the USED letters: every distinct letter of a-z that appears in at least one word, and
- the UNUSED letters: every letter of a-z that appears in none of the words.
Rules:
- Co... | [
{
"role": "system",
"content": "You track which letters of the alphabet a set of words uses.\n\nYou are given a few English words. Considering all of them together, report:\n - the USED letters: every distinct letter of a-z that appears in at least one word, and\n - the UNUSED letters: every letter of a-z... | <answer>
used (11): B E F I L N O R S T U
unused (15): A C D G H J K M P Q V W X Y Z
</answer> | <answer>
used (11): B E F I L N O R S T U
unused (15): A C D G H J K M P Q V W X Y Z
</answer> | false | 8,901 | charset_sft |
bullscows | 11 | 4 | true | 8394 | You are guessing a secret 4-digit number. All four digits are different (digits 0-9).
After each guess you are told:
bulls = how many digits are correct AND in the right position
cows = how many digits are in the number but in the wrong position
Use the bulls and cows from every guess to narrow it down. Briefly ... | [
{
"role": "system",
"content": "You are guessing a secret 4-digit number. All four digits are different (digits 0-9).\n\nAfter each guess you are told:\n bulls = how many digits are correct AND in the right position\n cows = how many digits are in the number but in the wrong position\n\nUse the bulls and... | From the clues so far (0731 → 0 bulls, 1 cow; 4812 → 0 bulls, 2 cows; 8045 → 1 bull, 1 cow), 62 numbers still fit every count; 2089 is one of them, so I'll try it. <guess>2089</guess> | From the clues so far (0731 → 0 bulls, 1 cow; 4812 → 0 bulls, 2 cows; 8045 → 1 bull, 1 cow), 62 numbers still fit every count; 2089 is one of them, so I'll try it. <guess>2089</guess> | false | 1,775 | bullscows_sft |
charcount | 1 | 1 | true | brachiopodous | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 13
vowels (6): A I O O O U
consonants (7): B R C H P D S
</answer> | <answer>
length: 13
vowels (6): A I O O O U
consonants (7): B R C H P D S
</answer> | false | 695 | charcount_sft |
charcount | 1 | 1 | true | solitudinarian | You analyze the characters of a word.
You are given one English word. Report:
- its length (total number of letters),
- its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and
- its consonants (every other letter, including Y), listed left-to-right with repeats.
Rules:
- Count every lette... | [
{
"role": "system",
"content": "You analyze the characters of a word.\n\nYou are given one English word. Report:\n - its length (total number of letters),\n - its vowels (the letters A, E, I, O, U), listed left-to-right with repeats, and\n - its consonants (every other letter, including Y), listed left-t... | <answer>
length: 14
vowels (7): O I U I A I A
consonants (7): S L T D N R N
</answer> | <answer>
length: 14
vowels (7): O I U I A I A
consonants (7): S L T D N R N
</answer> | false | 6,728 | charcount_sft |
End of preview. Expand in Data Studio
Word-Games Distillation
SFT data that teaches a small open model the atomic sub-skills of word games - especially Wordle - as a curriculum to run before reinforcement learning. Each game isolates one skill (map a word to its letters, track used/absent letters, judge validity & meaning, reason over letter multisets, rhyme, fill a pattern, and read feedback and adjust), so RL can later compose skills the model already owns. Most data is generated programmatically (exact, zero API cost); only the reasoning games are distilled from Claude.
- 96,162 samples · ~25.5M tokens (messages+completion; GPT-4o-tokenizer proxy, ~26-28M with chat-template overhead)
- 13 games, one unified row schema · 90/10 train/test split
- 99.3% valid (the
validflag is the quality gate)
Composition
| dimension | breakdown |
|---|---|
| producer | programmatic 93.9% (exact, no API) · Claude-distilled 6.1% (rejection-sampled) |
| reasoning style | direct / bare-answer 63.2% · programmatic worded reasoning 31.2% · distilled <think> CoT 5.6% |
| turns | single-turn 76.0% · multi-turn 24.0% |
Columns
| column | meaning |
|---|---|
game_name / game_no |
the game and its stable id (0=wordle ... 12=consistency) |
round |
turn number within the episode (1 for single-turn games) |
valid |
passed the quality gate - filter valid==True for training |
target |
the answer/secret the episode is about (a word, pair, code, or encoded challenge) |
system |
the system prompt |
messages |
the chat prompt: system + user (+ alternating assistant/user turns when multi-turn) |
completion |
the target reply to train on (may contain <think> CoT or worded reasoning) |
completion_no_think |
completion with any <think> block stripped (answer-only target) |
has_think |
whether completion contains a <think> chain-of-thought |
episode |
per-run episode index |
source |
origin file (provenance) |
Games
| # | game | rows | share | turns | producer | skill |
|---|---|---|---|---|---|---|
| 1 | charcount | 14,000 | 14.6% | single | programmatic | word to its length + vowel/consonant split |
| 2 | validity | 13,254 | 13.8% | single | programmatic | is it a real word? + its meaning (WordNet) |
| 7 | charset | 12,000 | 12.5% | single | programmatic | which letters of a-z are used / unused across words |
| 5 | rhyme | 10,000 | 10.4% | single | programmatic | rhymes - MCQ + free-generation (CMU dict) |
| 10 | codebreaker | 10,000 | 10.4% | multi | programmatic | Mastermind: crack a code from per-slot tick/dash/cross feedback |
| 11 | bullscows | 10,000 | 10.4% | multi | programmatic | guess a 4-digit number from bulls/cows counts |
| 12 | consistency | 10,000 | 10.4% | single | programmatic | is a candidate word still possible given Wordle clues? |
| 4 | endstart | 6,000 | 6.2% | single | programmatic | pick the option starting with a word's last letter |
| 9 | tower | 5,000 | 5.2% | single | programmatic | deduce floor/room placements from tick/cross feedback |
| 0 | wordle | 3,078 | 3.2% | multi | Claude | 5-letter word deduction from tick/dash/cross feedback - the RL target game |
| 6 | crossword | 1,500 | 1.6% | single | Claude | definition + masked pattern to the word (reasoning) |
| 3 | anagram | 1,000 | 1.0% | single | Claude | are two words anagrams? (reasoning) |
| 8 | mistakeid | 330 | 0.3% | single | Claude | spot a repeated grey/yellow mistake in a Wordle guess (reasoning) |
Usage
from datasets import load_dataset
ds = load_dataset("saketh-chervu/word-games-distillation")
train = ds["train"].filter(lambda r: r["valid"]) # keep gold samples
row = train[0]
# messages = chat prompt (system [+ user/assistant turns]); completion = target reply to learn.
prompt, target = row["messages"], row["completion"]
# Typical SFT: render the chat template, then train with loss on the completion only.
text = tokenizer.apply_chat_template(prompt, tokenize=False, add_generation_prompt=True) + target
# For an answer-only target (no reasoning), use row["completion_no_think"].
# Hold out a game via game_name to test skill transfer, or just use the test split.
Notes
- Quality gate: single-turn games pass by construction; reasoning games keep only correct +
<think>traces; Wordle keeps format-compliant (has-<think>) moves regardless of win/loss. Invalid rows are kept but flaggedvalid=False. - All word games draw from one shared multi-length vocabulary with per-game salted splits, so the model meets the whole vocabulary (incl. Wordle answers) without leaking Wordle eval.
- Built with the PixelPolicy framework; programmatic games are seeded and reproducible.
- Downloads last month
- 110