Ajibola Ojo

Research

Questions I am investigating, how I am testing them, and what has come out so far.

Ongoing research

  • Playing strength under compute constraints

    In progress

    How much playing strength can a chess engine reach under strict compute and memory limits, and which search techniques buy the most per node?

    Method

    • Fix time control and memory budget, then add one search technique at a time.
    • Measure depth, nodes per second and Elo against a fixed baseline for each configuration.

    See the project

Interests

AI agents, ML systems, program analysis, LLM evaluation, efficient inference.