final long logNodeStart(long parentIndex,Move m,int alpha,int beta,int ply,int depth){
  bb.putInt(0,(int)-1);
  bb.putInt(4,(int)parentIndex);
  bb.putShort(8,(short)(m.from + (m.to << 6) + (m.promoteTo << 12)));
  bb.putShort(10,(short)alpha);
  bb.putShort(12,(short)beta);
  bb.put(14,(byte)ply);
  bb.put(15,(byte)depth);
  try {
    bos.write(bb.array());
  }
 catch (  IOException e) {
    throw new RuntimeException();
  }
  return nextIndex++;
}

final long logNodeStart ( long parentIndex , Move m , int alpha , int beta , int ply , int depth ) { bb . putInt ( 0 , ( int ) - 1 ) ; bb . putInt ( 4 , ( int ) parentIndex ) ; bb . putShort ( 8 , ( short ) ( m . from + ( m . to << 6 ) + ( m . promoteTo << 12 ) ) ) ; bb . putShort ( 10 , ( short ) alpha ) ; bb . putShort ( 12 , ( short ) beta ) ; bb . put ( 14 , ( byte ) ply ) ; bb . put ( 15 , ( byte ) depth ) ; try { bos . write ( bb . array ( ) ) ; } catch ( IOException e ) { throw new RuntimeException ( ) ; } return nextIndex ++ ; }
log information when entering a search node .
