Talk:Stair-climbing puzzle: Revision history

6 February 2010

• curprev 14:5914:59, 6 February 2010‎ rosettacode>UnderBot‎ m 464 bytes 0‎ moved Talk:Stair Climbing to Talk:Stair-climbing puzzle

7 November 2009

• curprev 10:4110:41, 7 November 2009‎ rosettacode>ShinTakezou‎ 464 bytes −958‎ →‎Problem statement: okok read better the task, it falls one step when unsuccessfull so it needs to climb 2, 3...:)
• curprev 10:3910:39, 7 November 2009‎ rosettacode>ShinTakezou‎ 1,422 bytes +637‎ →‎Problem statement: ? recursion unnecessary and wrong? ?
• curprev 10:3010:30, 7 November 2009‎ rosettacode>ShinTakezou‎ 785 bytes +321‎ →‎Problem statement
• curprev 00:3000:30, 7 November 2009‎ Underscore talk contribs‎ 464 bytes +273‎ No edit summary

6 November 2009

• curprev 23:5223:52, 6 November 2009‎ 71.59.209.100 talk‎ 191 bytes +191‎ Created page with 'The problem is ambiguous as stated. It says to climb one step up, not climb up one step up from the starting position. Thus the original C# code that was there solved the 'climb …'