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.
  1. Prepare
  2. Algorithms
  3. Game Theory
  4. Misère Nim
  5. Discussions

Misère Nim

  • sergej_panov
     + 0 comments

    Ruby solution:

    def misereNim(s)
    # Write your code here
    total_xor = 0;
    total = 0;

    s.each_index do |i|
        total_xor ^= s[i];
        total += s[i];
    end

    if(s.size % 2 == 0)
        return s.size != total && total_xor == 0 ? "Second" : "First";
    else
        return s.size == total || total_xor == 0 ? "Second" : "First";
    end
end