Re-send: The correct answer is Sum of C(2n-i,n)*C(n,i) over 0<=i<=n 1: 3 2: 13 3: 63 4: 321 5: 1683 6: 8989 7: 48639 8: 265729 9: 1462563 10: 8097453
On May 8, 3:59 am, PopUp <[EMAIL PROTECTED]> wrote: > Hi, > Consider the chess as a two dimensional array. How will I find the > number of ways in which queen can reach (n,n) from (0,0). Only > up,down,diagonal moves are allowed(obviously no back moves). > > PopUp --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
