we have all the numbers written from 1- n. 2 players play alternatively. At any turn , a player removes a number and along with all its divisors present in the list. Player to remove last number wins.
so given initial number n and player who is starting first , we are to find who wins if both play optimum. NOW , i have found that the the player who starts ALWAYS wins. Can anyone prove this or still better come up with a real strategy ! cheers - nikhil Every single person has a slim shady lurking ! --~--~---------~--~----~------------~-------~--~----~ 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 algogeeks+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
