comefrom: <awangdev>Word Search_2.java
code: public boolean search(char[][] board, String word, int i, int j, int start) {
          if (start == word.length()) {
              return true;
          }
          if (i < 0 || i >= board.length || j < 0 || j >= board[0].length || board[i][j] != word.charAt(start)) {
              return false;
          }
          board[i][j] = '#';
          boolean rst = search(board, word, i, j - 1, start + 1)
          || search(board, word, i, j + 1, start + 1)
          || search(board, word, i + 1, j, start + 1)
          || search(board, word, i - 1, j, start + 1);   
          board[i][j] = word.charAt(start);
          return rst;
      }
masked: public boolean sample_funcname ( char [ ] [ ] board , String word , int i , int j , int start ) {
    if ( start == word . length ( ) ) {
      return true ;
    }
    if ( i < 0 || i >= board . length || j < 0 || j >= board [ 0 ] . length || board [ i ] [ j ] != word . charAt ( start ) ) {
      return false ;
    }
    board [ i ] [ j ] = '#' ;
    boolean rst = search ( board , word , i , j - 1 , start + 1 ) || search ( board , word , i , j + 1 , start + 1 ) || search ( board , word , i + 1 , j , start + 1 ) || search ( board , word , i - 1 , j , start + 1 ) ;
    board [ i ] [ j ] = word . charAt ( start ) ;
    return rst ;
  }
  