In normal Nim game the player taking the last object wins. And terminal position here is always a P -position. Now, I have a question where you are given the terminal P and N positions unlike the only terminal condition in normal Nim. Is this a variation of Nim? If yes, how to analyze it, how should I go about assigning grundy numbers?

Formally:-

I have n heaps with represented by a set S={a