Representing a sequence of moves

Question

I'm working on a board game project and I'm having trouble understanding how to store the moves for the game called Go or Igo.
I've already tried using linked lists below. Each stone has a list of next move stones. I have a stone manager that keeps track of the list of possible first moves and these first moves have the list of next moves. A stone can have multiple next moves because you're editing or reviewing a game to show a better variation or if a move was undone during the game.
Below the removal of stones doesn't work.
package test;
import java.util.LinkedList;
public class Main
    public static void main(String[] args)
        SM sm = new SM();
        sm.addStone(new Stone(0));
        sm.addStone(new Stone(1));
        sm.addStone(new Stone(2));
        sm.addStone(new Stone(3));
        sm.addStone(new Stone(4));
        sm.removeStone( sm.getPlay(0), 1);
        sm.print();
class SM
    private Stone       m_C     = null; // the current stone
    private LinkedList  m_Plays = new LinkedList(); // stores the first move[s]
    public void addStone(Stone stone)
        if( isEmpty() )
            m_Plays.addLast(stone);
            m_C = stone;
        else
            m_C.addNext(stone);
            m_C = stone;
    public Stone getPlay(int index) // retrieve a first move
        if( i >= 0 && i < m_Plays.size() )
            return (Stone)m_Plays.get(index);
        return null;
    public void removeStone(Stone stone, int id)
        if( stone == null ) return;
        if( stone.getID() == id )
            stone = null;
            return;
        for( int i=0; i<stone.nextCount(); i++)
            removeStone(stone.getNext(i), id );
    public void print()
        Stone temp = this.getPlay(0);
        do
            System.out.println("ID: " + temp.getID());
            if( temp.isLast() == false )
                temp = temp.getNext(0);
        }while( temp.isLast() == false );
    public boolean isEmpty(){ return m_Plays.isEmpty(); }
class  Stone
    public int                  m_id        = 0;
    private LinkedList          m_Next      = new LinkedList();
    private int                 m_INext     = 0;
    private Stone               m_Previous  = null;
    public Stone( int id )
        m_id = id;
    public int getID()
        return m_id;
    public void addNext(Stone stone)
        m_Next.addLast(stone);
    public Stone getNext(int i)
        if( i >=0 && i < m_Next.size() )
            return (Stone)m_Next.get(i);
        return null;
    public void removeNext(int id)
        for( int i=0; i<m_Next.size(); i++ )
            if( ((Stone)m_Next.get(i)).getID() == id )
                m_Next.remove(i);
    public int nextCount(){ return m_Next.size(); }
    public Stone getPrevious(){ return m_Previous; }
    public void  setPrevious(Stone s){ m_Previous = s; }
    public boolean isLast(){ return m_Next.isEmpty(); }
}I feel either I'm doing something wrong or this implementation isn't possible in Java. My last thought idea to solve this problem was to merely have a single list in the stone manager that stores all the stones. Each stone has a list of ID's that refer to either the next stone or previous stone and I can use this ID to remove/add stones in the list in the stone manager.

Answer 1

Kurorugi wrote:
Below the removal of stones doesn't work.You'll need to provide more detail than "doesn't work."
I'd also suggest more descriptive names for classes, methods, and variables. I have no idea what the "SM" class is supposed to be for, and with the following:
class  Stone
    public int                  m_id        = 0;
    private LinkedList          m_Next      = new LinkedList();
    private int                 m_INext     = 0;
    private Stone               m_Previous  = null;
it's not clear at all what those variables represent. I'm not even sure what a Stone object represents. Is it a stone that has been placed on the board?