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

Sort by

recency

|

36 Discussions

|

  • adventureroyal12
     + 0 comments

    Fascinating game! Misère Nim adds a unique twist to the classic Nim strategy, making it even more challenging dune buggy safari in dubai

  • powersteelpeb
     + 0 comments

    Misère Nim offers an interesting twist on the classic Nim game, adding a strategic challenge where the goal is to force your opponent to take the last object! steel fabrication uae

  • dehaka
     + 0 comments
    string nimGame(const vector<int>& pile) {
    int XOR = 0, twoOrMore = 0;
    for (int x : pile) {
        XOR = XOR ^ x;
        if (x > 1) twoOrMore++;
    }
    if (twoOrMore > 1) return (XOR == 0) ? "Second" : "First";
    else if (twoOrMore == 1) return "First";
    else return (pile.size() % 2 == 0) ? "First" : "Second";
}

  • hivan_71
     + 1 comment

    How did you know that an XOR operation solved the problem? What is the relationship?

  • ihorfinance
     + 0 comments

    C++ (more at https://github.com/IhorVodko/Hackerrank_solutions/tree/master , feel free to give a star :) )

    std::string misereNim(std::vector<int> const & _piles){
    int binSum = 0;
    int sum = 0;
    for(auto const & stones : _piles){
        binSum ^= stones;
        sum += stones;
    }
    if(_piles.size() == sum){
        return _piles.size() % 2 == 0 ? "First" : "Second";
    }
    return binSum ? "First" : "Second";
}