Benchmark Tasks
===============

.. module:: structured_stochasticity.tasks

Tasks are chosen to have:

- Exact algorithmic solutions (objectively verifiable)
- Scalable complexity (parameterized difficulty)
- Minimal heuristic shortcuts (tests true reasoning)

Data Classes
------------

.. autoclass:: TaskInstance
   :members:
   :show-inheritance:

.. autoclass:: TaskResult
   :members:
   :show-inheritance:

Base Task Class
---------------

.. autoclass:: Task
   :members:
   :show-inheritance:

Tower of Hanoi
--------------

.. autoclass:: TowerOfHanoi
   :members:
   :show-inheritance:

   The classic recursive puzzle and our flagship task because:

   1. It has exact recursive structure
   2. Complexity grows exponentially (2^n - 1 moves)
   3. Early commitment to wrong approach is fatal
   4. Solution is easily verifiable

Arithmetic Sequence
-------------------

.. autoclass:: ArithmeticSequence
   :members:
   :show-inheritance:

Logical Deduction
-----------------

.. autoclass:: LogicalDeduction
   :members:
   :show-inheritance:

Task Factory
------------

.. autoclass:: TaskFactory
   :members:
   :show-inheritance:

   **Available Tasks:**

   - ``tower_of_hanoi`` - Tower of Hanoi puzzle
   - ``arithmetic`` - Multi-step arithmetic
   - ``logical_deduction`` - Logical ordering puzzles