background_color=c_black; screen_width=monitor_width; screen_height=monitor_height; full_screen=true; show_cursor=false; show_score=false; level=5; state='Main'; c[1]=c_red; c[2]=c_blue; c[3]=c_white; c[4]=c_yellow; c[5]=c_fuchsia; c[6]=c_navy; c[7]=c_olive; c[8]=c_purple; c[9]=c_teal; end_loop=1; while(end_loop) { //***Main*** if state=='Main' { font_size = screen_width/1024*60; font_color = c_white; font_align = fa_center; font_style = fs_bold; font_name = 'Comic Sans MS'; Y=5; draw_text(screen_width/2,Y,'Die Türme von Hanoi'); Y+=string_height('M'); font_size = screen_width/1024*20; draw_text(screen_width/2,Y,'by Ben Strasser alias Dr.Voodoo'); Y+=string_height('M'); font_size = screen_width/1024*40; draw_text(screen_width/2,Y,'Spiel starten'); Y+=string_height('M'); draw_text(screen_width/2,Y,'Level auswählen'); Y+=string_height('M'); draw_text(screen_width/2,Y,'Hilfe'); Y+=string_height('M'); draw_text(screen_width/2,Y,'Web'); Y+=string_height('M'); draw_text(screen_width/2,Y,'Beenden'); font_size=screen_width/1024*60; Y=5+string_height('M'); font_size=screen_width/1024*20; Y+=string_height('M'); font_size=screen_width/1024*40; if mouse_y>Y&&mouse_yY&&mouse_y9 show_message('Nummer ist nicht zwischen 3 and 9!') else level=temp } }; Y+=string_height('M'); if mouse_y>Y&&mouse_yY&&mouse_yY&&mouse_ypick||string_copy(tower1,string_length(tower1),1)=='' { tower1+=string(pick) pick=0 } }; if tower_temp==1 { if real(string_copy(tower2,string_length(tower2),1))>pick||string_copy(tower2,string_length(tower2),1)=='' { tower2+=string(pick) pick=0 } }; if tower_temp==2 { if real(string_copy(tower3,string_length(tower3),1))>pick||string_copy(tower3,string_length(tower3),1)=='' { tower3+=string(pick) pick=0 } }; } }; }; //***Help*** if state=='Help' { font_size = screen_width/1024*27; font_color = c_white; font_align = fa_left; font_style = fs_bold; font_name = 'Comic Sans MS'; draw_text_ext(20,5,'Die Türme von Hanoi ist ein Strategie Puzzle. Das Ziel ist es den Stapel aus Scheiben von einer Stange zur anderen zu bringen. Die Schwierigkeit besthet darin, das man eine Scheibe nur auf eine größere legen kann. Das ist es, weshalb es ein Gedächtnis Training ist. Versuche das Rätsel in so wenig wie möglich Versuchen zu lösen.##(orig.) The Towers of Hanoi © Ben Strasser 2003.#Dieses Programm ist programmiert von Ben Strasser unter verwendung von Gamemaker welcher von Mark Overmars programmiert wurde#Gamemaker © Mark Overmars 1999-2002.#www.gamemaker.nl#Ins Deutsche übersetzt von Mike Soft#www.mike.soft.at.tf',string_height('M'),screen_width-40) if mouse_check_button(mb_left) { state='Main' mouse_clear(mb_left) } } //draw_cursor brush_color=make_color(100,100,100) pen_color=c_black; draw_triangle(mouse_x,mouse_y,mouse_x+20,mouse_y+20,mouse_x+20,mouse_y+40) brush_color=make_color(200,200,200); draw_triangle(mouse_x,mouse_y,mouse_x+20,mouse_y+20,mouse_x+40,mouse_y+20) brush_color=make_color(150,150,150); draw_triangle(mouse_x+20,mouse_y+40,mouse_x+20,mouse_y+20,mouse_x+40,mouse_y+20); //refresh if keyboard_check(vk_escape) state='Main'; screen_refresh(); io_clear(); io_handle(); pen_color=c_black; brush_color=c_black; draw_rectangle(0,0,screen_width,screen_height) }; game_end()