mirror of
https://github.com/open-thought/reasoning-gym.git
synced 2026-04-19 12:58:07 +00:00
fix: Unify Prompts (#254)
* remove cot * fix prompt template * fix pool matrix * spiral matrix fixed
This commit is contained in:
parent
49db4ed761
commit
01e1c8f9af
31 changed files with 65 additions and 354 deletions
|
|
@ -23,16 +23,6 @@ In the case a state is repeated the answer is the state before the repetition!
|
|||
The output should be the count of each block type after the rules have been applied in the order they are listed above.
|
||||
For example 1 0 3 0 2 0 0 0 1 means that you have 1 [A] 0 [B] 3 [C] 0 {{A}} 2 {{B}} 0 {{C}} 0 (A) 0 (B) 1 (C).
|
||||
|
||||
Example:
|
||||
- Input: You have 2 [A], 3 [B], and 3 [C].
|
||||
- Output: 0 0 0 2 1 0 0 0 0
|
||||
- Explanation:
|
||||
0. Initial state: 2 3 3 0 0 0 0 0 0
|
||||
1. We can apply Rule 1 and obtain 1 {{A}}. New state: 1 2 2 1 0 0 0 0 0
|
||||
2. We can apply Rule 1 again and obtain 1 {{A}}. New state 0 1 1 2 0 0 0 0 0
|
||||
3. We can apply Rule 3 and obtain 1 {{B}}. New state 0 0 0 2 1 0 0 0 0
|
||||
4. No more rules can be applied. The answer is 0 0 0 2 1 0 0 0 0
|
||||
|
||||
Now, you have {A_square} [A], {B_square} [B], and {C_square} [C] blocks. Provide the count of each block type after applying the above rules.
|
||||
"""
|
||||
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue