mirror of
https://github.com/open-thought/reasoning-gym.git
synced 2026-04-22 16:49:06 +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
|
|
@ -17,18 +17,7 @@ Evaluate the following rules in order, and apply the first applicable rule to th
|
|||
Once you have applied a rule, repeat the process with the new string until no further transformations can be performed (i.e. the string doesn't change), or a state is repeated.
|
||||
If a state is repeated, the process is terminated, and the repeated state is discarded (i.e. is not considered as the final answer) and the state before the repeated state is considered as the final answer.
|
||||
|
||||
Example:
|
||||
- Input:
|
||||
- String: abbac
|
||||
- Rules:
|
||||
1. If the string prefix is 'ab', replace it with 'ca'.
|
||||
2. If the string prefix is 'ca', replace it with 'bb' and append 'c' to the end.
|
||||
3. If the string ends with 'aa', replace it with 'cc'.
|
||||
- Output: bbbacc
|
||||
- Explanation:
|
||||
- In the first iteration, rule 1 is applied to the string abbac, resulting in cabac
|
||||
- In the second interation, rule 1 doesn't apply, but rule 2 is applied to the string cabac, resulting in bbbacc
|
||||
- In the third iteration, none of the rules (1, 2, 3) apply, so the process is terminated, and the final answer is bbbacc
|
||||
Your output should be the final transformed string after applying all the rules.
|
||||
|
||||
Transform the following string according to the above list of rules:
|
||||
{string}
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue