汉诺塔问题的MySQL实现

SET @n = 4; -- 这里设置汉诺塔的层数

WITH RECURSIVE
  -- 计算最少移动次数
  min_moves AS (
    SELECT POW(2, @n) - 1 AS min_moves_count
  ),
  -- 定义汉诺塔递归算法
  hanoi_steps (src, dest, tmp, n, steps) AS (
    SELECT 1, 3, 2, @n, CAST(CONCAT('Move disk ', @n, ' from peg ', 1, ' to peg ', 3) AS CHAR(1024))
    UNION ALL
    SELECT
      src,
      tmp,
      dest,
      n - 1,
      CAST(CONCAT(steps, ' -> Move disk ', n - 1, ' from peg ', src, ' to peg ', tmp) AS CHAR(1024))
    FROM hanoi_steps
    WHERE n > 1
  )
SELECT min_moves_count, steps
FROM min_moves, hanoi_steps
WHERE hanoi_steps.n = 1;

注意MySQL变量存储有限制，所以需要以下操作，避免steps过长

CAST(CONCAT('Move disk ', @n, ' from peg ', 1, ' to peg ', 3) AS CHAR(1024))

上述steps结果仍有问题，只能输出前几步