[转帖] 用C# Generator解决Hanoi塔问题-优快云博客

本文介绍了一种使用C#中的迭代器实现汉诺塔问题的方法，并展示了如何利用递归生成移动步骤。通过枚举和结构体等特性，该实现不仅清晰易懂，还有效地展示了生成器在解决复杂问题上的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

下面的代码从[url=http://dotnet.sys-con.com/read/47002.htm]Iterators in C#: Nothing Beats the Foreach Loop[/url]转来。

using System.Collections.Generic;

public enum Peg { A, B, C };

public struct Move {
    public Move( Peg from, Peg to ) { From = from; To = to; }
    public readonly Peg From;
    public readonly Peg To;
}

class TowerofHanoi {
    public static IEnumerable<Move> GenerateMoves(
        int n, Peg from, Peg to, Peg middle ) {
        if ( n == 1 )
            yield return new Move( from, to );
        else {
            foreach ( Move m in GenerateMoves( n - 1, from, middle, to ) )
                yield return m;

            yield return new Move( from, to );

            foreach ( Move m in GenerateMoves( n - 1, middle, to, from ) )
                yield return m;
        }
    }
}

class Program {
    static void Main( string[ ] args ) {
        foreach ( Move m in
            TowerofHanoi.GenerateMoves( 10, Peg.A, Peg.B, Peg.C ) ) {
            System.Console.WriteLine( "From {0} to {1}", m.From, m.To );
        }
    }
}