mirror of
https://github.com/open-thought/reasoning-gym.git
synced 2026-04-29 17:35:16 +00:00
added quantum lock curriculum (#324)
This commit is contained in:
parent
e9944149bd
commit
91b3347d53
3 changed files with 94 additions and 6 deletions
|
|
@ -1,6 +1,6 @@
|
|||
import pytest
|
||||
|
||||
from reasoning_gym.graphs.quantum_lock import QuantumLockConfig, QuantumLockDataset
|
||||
from reasoning_gym.graphs.quantum_lock import QuantumLockConfig, QuantumLockCurriculum, QuantumLockDataset
|
||||
|
||||
|
||||
def test_quantumlock_config_validation():
|
||||
|
|
@ -37,7 +37,6 @@ def test_quantumlock_items():
|
|||
|
||||
# Check metadata contains required fields
|
||||
assert "solution_path" in item["metadata"]
|
||||
assert "difficulty" in item["metadata"]
|
||||
assert "buttons" in item["metadata"]
|
||||
assert "initial_state" in item["metadata"]
|
||||
assert "target_value" in item["metadata"]
|
||||
|
|
@ -115,3 +114,73 @@ def test_quantumlock_scoring():
|
|||
if solution:
|
||||
lower_solution = "".join(solution).lower()
|
||||
assert dataset.score_answer(lower_solution, item) == 1.0
|
||||
|
||||
|
||||
def test_quantum_lock_curriculum():
|
||||
"""Test the QuantumLockCurriculum functionality"""
|
||||
curriculum = QuantumLockCurriculum()
|
||||
|
||||
base_value = {"size": 150, "seed": 1}
|
||||
|
||||
# Test initial configuration
|
||||
base_cfg = curriculum.generate_configuration(base_value)
|
||||
assert base_cfg.seed == 1
|
||||
assert base_cfg.size == 150
|
||||
assert base_cfg.difficulty == 1 # Default difficulty level
|
||||
|
||||
# Test incrementing difficulty attribute
|
||||
curriculum.increment_attr_level("difficulty")
|
||||
increased_cfg = curriculum.generate_configuration(base_value)
|
||||
assert increased_cfg.difficulty == 2
|
||||
assert increased_cfg.seed == 1 # Unchanged
|
||||
assert increased_cfg.size == 150 # Unchanged
|
||||
|
||||
# Test incrementing difficulty attribute again
|
||||
curriculum.increment_attr_level("difficulty")
|
||||
increased_cfg_2 = curriculum.generate_configuration(base_value)
|
||||
assert increased_cfg_2.difficulty == 3
|
||||
|
||||
# Test decrementing difficulty attribute
|
||||
curriculum.decrement_attr_level("difficulty")
|
||||
decreased_cfg = curriculum.generate_configuration(base_value)
|
||||
assert decreased_cfg.difficulty == 2
|
||||
|
||||
# Test global level adjustments
|
||||
curriculum = QuantumLockCurriculum() # Reset curriculum
|
||||
assert curriculum.get_attr_level("difficulty") == 0 # Default level is 0, maps to difficulty=1
|
||||
|
||||
# Increase global level
|
||||
curriculum.increment_global_level()
|
||||
assert curriculum.get_attr_level("difficulty") == 1
|
||||
|
||||
global_level_cfg = curriculum.generate_configuration(base_value)
|
||||
assert global_level_cfg.difficulty == 2
|
||||
|
||||
# Increase global level again
|
||||
curriculum.increment_global_level()
|
||||
assert curriculum.get_attr_level("difficulty") == 2
|
||||
|
||||
global_level_cfg_2 = curriculum.generate_configuration(base_value)
|
||||
assert global_level_cfg_2.difficulty == 3
|
||||
|
||||
# Decrease global level
|
||||
curriculum.decrement_global_level()
|
||||
assert curriculum.get_attr_level("difficulty") == 1
|
||||
|
||||
global_level_cfg_3 = curriculum.generate_configuration(base_value)
|
||||
assert global_level_cfg_3.difficulty == 2
|
||||
|
||||
# Test upper bound
|
||||
curriculum = QuantumLockCurriculum() # Reset curriculum
|
||||
for _ in range(15): # Try going beyond max level (10)
|
||||
curriculum.increment_attr_level("difficulty")
|
||||
|
||||
max_cfg = curriculum.generate_configuration(base_value)
|
||||
assert max_cfg.difficulty == 10 # Should be capped at 10 (the highest level)
|
||||
|
||||
# Test lower bound
|
||||
curriculum = QuantumLockCurriculum() # Reset curriculum
|
||||
curriculum.decrement_attr_level("difficulty") # Try going below min level
|
||||
|
||||
min_cfg = curriculum.generate_configuration(base_value)
|
||||
assert min_cfg.difficulty == 1 # Should be capped at 1 (the lowest level)
|
||||
|
|
|
|||
Loading…
Add table
Add a link
Reference in a new issue