We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Loading...
  1. Practice
  2. Functional Programming
  3. Ad Hoc
  4. Game of Kyles
  5. Discussions

Game of Kyles

Sort 6 Discussions, By:

votes

  • karoyakani + 1 comment

    The title should read "... Kayles". OEIS A002186 Sprague-Grundy values for the game of Kayles (octal games .77 and .771).

    Hasekll excerpt

    kayles = (==0) . foldl1 xor . map (grundy!!)

grundy = map g [0..]
    where
    g 0 = 0
    g n = mex n [grundy!!l `xor` grundy!!r | m<-[n-1,n-2],l<-[0..m`div`2],let r=m-l]
    mex n = minimum . ([1..n] \\)

  • skanaley + 1 comment

    In test case 1, how are the last two "IXIXIII" and "XIIIXIXXIX" wins? And are there different test cases for different languages?

    • ivanbessonov + 0 comments

      Winning moves for these cases:
      IXIXIII -> IXIXIXI
      XIIIXIXXIX -> XIXIXIXXIX

  • piyushmishra + 1 comment

    does dynamic programming work.

  • piyushmishra + 1 comment

    Hi Abhiranjan,

    What does it mean if both player play optimally?

    • abhiranjanChallenge Author + 0 comments

      At the respective chance, they will choose the best step.

  • hasan_nagizada + 0 comments

    can someone give me full code for this project?

  • dileepkumarjami + 1 comment

    can i code it in C language

    • abhiranjanChallenge Author + 1 comment

      Hi, since this is a functional programming track only those languages which have extensive support to this paradigm is allowed.
      Probably you are looking for algorithm track.

      • amazinghacker + 1 comment

        but is it possible that we can solve it using c/c++, python

        • evhiness + 0 comments

          As they are turing complete languages, yes.

No more comments