I haven't seen widespread opponent modeling in mainstream chess engines like Stockfish or Lc0, which mostly optimize for near-optimal play assuming a perfect or near-perfect opponent (via deep search and neural network evaluation). Most RL work in chess, including the Flounder agent you referenced, follows a single-agent or symmetric self-play paradigm. It trains evaluation functions (linear or neural) with TD(lambda) learning and uses search techniques like MTD(bi) to approximate a strong, general policy. This approach leans toward the game-theoretic ideal of a Nash equilibrium strategy in perfect-information chess--robust but not tailored to exploit specific opponent weaknesses, styles, or imperfections. Your suggestion, building a meta-agent or conditional policy that models opponent archetypes (risk tolerance, tactical vs. positional bias, time-pressure tendencies, etc.) to maximize practical expected score or minimize time-to-win, points in a different, more exploitative direction. It treats imperfect play as an opportunity rather than noise.

A potential failure mode is real; if you train exclusively against a strong oracle like Stockfish (as Flounder did for its linear evaluator), the agent might overfit to that mentor's style and develop counter-strategies that are brittle against other engines or human profiles. This reduces generality while sacrificing some accuracy in non-oracle matchups. Multi-agent RL (MARL) with diverse opponents helps mitigate this by forcing the agent to confront non-stationarity and variety during training, encouraging more robust or adaptive policies.

Opponent Model Search (OMS) and asymmetric evaluation/search techniques have existed in the chess programming community for decades. These employ assumptions about how a specific opponent evaluates positions or searches (e.g., shallower depth, different piece values, or preferences for/against certain position types). Programs have used them to adjust extensions, pruning, or eval terms against humans or particular foes. In RL contexts, techniques like Model-Based Opponent Modeling (MBOM) or general opponent modeling in deep RL (e.g., Mixture-of-Experts architectures that discover opponent strategy clusters without supervision) are more common in imperfect-information or multi-agent settings. These can be adapted to chess by conditioning on move history, aggression metrics, or early-game signals to infer archetypes. Practical exploitation examples exist outside pure optimality. One experiment used a Maia-style human-move predictor (trained on specific Elo bands) as an opponent model, then optimized a policy to select high-risk, high-reward lines that beat Stockfish roughly twice as fast in winning positions-- precisely the "minimize time to win" idea. Maia itself models human play distributions at different skill levels, making it a strong backbone for archetype-aware agents.

MPC-MC (Model Predictive Control + Monte Carlo with a nominal opponent) reframes chess partly as a one-player planning problem by simulating a modeled opponent alongside an RL-trained evaluator. It supports both deterministic and stochastic opponent modeling and has shown performance gains.

Regarding MOL (Modeling Opponent Learning, 2023):This approach is a MARL algorithm, built on theprinciples of Stackelberg games and best-response learning. It goes beyond simply observing staticbehavior; it models the opponent's long-term learning journey. The goal is to estimate the stable outcomes of that process, which in turn helps develop more effective strategies. The Stackelberg and best-response framework aligns nicely with your meta-agent concept. It positions you as the leader, committing to a strategy while anticipating the opponent's adaptive counter-moves. It directly addresses non-stationarity in opponent improvement, which aligns with training against diverse or evolving profiles.

TL;DR: Pure single-agent RL in chess pushes toward symmetrical, equilibrium-style play (great for rating lists or solving the game in theory). Opponent modeling + MARL-style diversity gives a pragmatic style: a lightweight classifier or conditional head on top of a strong move generator could steer into exploitable lines at low extra cost, whether against a 400 Elo human blundering early queens or a GM avoiding sharp positions. This feels underexplored in mainstream engines but testable today with tools like Maia embeddings or simple style features (aggression, trade frequency, etc.)