open-thought/reasoning-gym
1
0
Fork 0
mirror of https://github.com/open-thought/reasoning-gym.git synced 2026-04-19 12:58:07 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix: Unify Prompts (#254)

Browse source 
* remove cot
* fix prompt template
* fix pool matrix
* spiral matrix fixed
This commit is contained in:
Zafir Stojanovski 2025-03-03 21:55:53 +01:00 • committed by GitHub
parent 49db4ed761
commit 01e1c8f9af
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
31 changed files with 65 additions and 354 deletions
Download patch file Download diff file Expand all files Collapse all files

19
reasoning_gym/graphs/shortest_path.py
View file

@ -16,23 +16,12 @@ The grid is represented as a matrix with the following types of cells:
- X: a blocked cell
Therefore, you need to find the shortest path from * to #, moving only through open cells.
You may only move in four directions: up, down, left, and right.
If there is no path from * to #, simply write "infeasible" (without quotes).
Example 1:
- Input: Find the length of the shortest path from * to # in the following grid:
X X X X X
X * O O X
X O X O X
X X X O #
- Output: right right down down right
Example 2:
- Input: Find the length of the shortest path from * to # in the following grid:
X X X X X
X * O O X
X O X O X
X X X X #
- Output: infeasible
Your output should be a sequence of directions that leads from * to #, e.g. right right down down up left
Now, find the length of the shortest path from * to # in the following grid:
{grid}