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 algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
