- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper proposes PW-MCTS, a test-time search method that refines a pretrained PPO routing policy through Monte Carlo tree search over native CAD operations in PCBWorld. The method uses board-wise iterated Bellman calibration to align critic outputs with target-board returns, determinizes the CAD engine for reproducible branch evaluation, and introduces incremental checkpointing, memoized branch-packed inference, and invalid-action filtering to reduce search overhead. Experiments are conducted on 50 open-source PCBs from PCBWorld-Bench, using a policy trained only on synthetic boards. The paper reports improvements over the same pretrained PPO policy under equal draws and matched rollout-time budgets.
Critical strengths
- Test-time refinement over native CAD operations is a reasonable direction. Instead of retraining the policy or searching in a grid abstraction, PW-MCTS searches directly over engine-level CAD actions. This is a sensible way to study test-time policy improvement for PCB routing. However, it is open to question whether doing so guarantees a legal outcome.
- The engineering optimizations are useful. Determinizing the CAD engine, incremental checkpointing, memoized branch-packed inference, and invalid-action filtering address real practical bottlenecks in CAD-grounded search. These contributions could be valuable for future work in this area.
Critical weaknesses
-
The method does not adequately address practical PCB design constraints, and the reported layouts appear to violate basic manufacturability requirements. The paper relies on engine-level DRC, action masking, and invalid-action filtering, but it does not provide a mechanism for users to manually add or prioritize custom design constraints, such as angle restrictions, differential-pair rules, impedance requirements, length matching, keepouts, or layer-specific constraints. More importantly, from the rendered layouts, I observe what appear to be 90-degree traces (e.g., board 0344) and potential shorts (e.g., board 0122). If confirmed, such layouts would be directly unusable in practice. The paper should clarify whether these layouts pass all relevant DRC checks and whether “clean pass” truly covers all error-severity violations. As presented, the methodology cannot guarantee that the final layout satisfies all constraints or flexible user requirements. Even without enforcing stricter constraints, PW-MCTS is only comparable to or worse than Freerouting. If such constraints were enforced, performance would likely degrade further.
-
The experimental comparison is not convincing, and the definition of routability metric is wrong. The definition of “routability” is confusing. Actually, the definition of Eq. 6 cannot be described as "routability".In addition, the only classical external baseline is Freerouting, which is a single A*-based tool and may not represent stronger classical routers. For example, the incomplete route in case 0134 may be an artifact of Freerouting’s limited parameterization rather than a fundamental limitation of classical routing. Stronger baselines such as pcbrouter, tuned KiCad routers, or commercial routers should be compared, ideally under matched time or computation budgets. Table 11 already shows that PW-MCTS is below Freerouting on several metrics; this undermines the claim that the proposed method is a competitive routing approach.
-
The convergence and stability of the Transformer-based policy are central but insufficiently explained. Given the heterogeneous token types and the factored action space, the paper’s key premise is that the model can converge and produce stable actions. However, the paper mainly lists architecture and PPO hyperparameters. It lacks training curves, policy entropy, gradient norms, value-loss behavior, seed variance, action-distribution stability, and failure-mode analysis. Without these diagnostics, it is difficult to assess whether the model genuinely converges in a stable way or whether the reported behavior is fragile.
Questions for authors
- For Figure 11, especially boards 0122 and 0344, please provide DRC reports. Do these layouts contain 90-degree traces or shorts? If so, how do they pass the paper’s clean-pass criterion?
- How can a user add or enforce custom design constraints, such as angle limits, impedance, differential pairs, length matching, keepouts, or layer restrictions? What happens to performance when such constraints are enforced?
- Why does PW-MCTS underperform Freerouting in Table 11 even without strict constraints? Can the authors provide matched-time comparisons against Freerouting and other classical routers such as pcbrouter?
- What evidence can the authors provide for convergence and stable action output? Specifically, training/validation curves, policy entropy, gradient norms, seed variance, and action-distribution stability across checkpoints would help.