Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

//try 12 (or any even number above) for crabs :) #include #include using namespace std; using namespace ifm; void X(int n); void Y(int n); void Z(int n); //Post: w_i^Y is drawn void X(int n){ if (n==0)forward(); else{ Y(n-1); left(90); Z(n-1); left(90); X(n-1); left(90); Z(n-1); left(90); Y(n-1); } } //Post: w_i^x is drawn void Y(int n){ if (n==0)forward(); else{ X(n-1); right(90); Z(n-1); right(90); Y(n-1); right(90); Z(n-1); right(90); X(n-1); } } void Z(int n){ if (n>1){ Z(n-1); forward(); right(90); } } int main(){ int n; cout<<"Welche Stufe?"<>n; Y(n); }