Create a function using Java: Number of Rows = 3-6 Number of Columns = 3-6 Function Name: hint Parameters: board: 2D integer array, piece: integer Return: 1D integer array (length 2) where array stores {row,column} of hint Assume board is valid 2D int array, piece is X==1/O==2 The hint scans across each row left to right, starting at the top row working down in rows. It returns a 1D integer array {r,c} containing the first hint found for the piece given to win. It does not examine for any other hints like blocking opponent’s win, or other types of hints. The only hint returned will be the first hint found that wins the game on the next play for the player. If it does not find a hint, it returns {-1, -1}. please follow this pseudo-code for the hint function:
Create a function using Java:
Number of Rows = 3-6
Number of Columns = 3-6
Function Name: hint
Parameters: board: 2D integer array, piece: integer
Return: 1D integer array (length 2) where array stores {row,column} of hint
Assume board is valid 2D int array, piece is X==1/O==2
The hint scans across each row left to right, starting at the top row working down in rows. It
returns a 1D integer array {r,c} containing the first hint found for the piece given to win. It does
not examine for any other hints like blocking opponent’s win, or other types of hints. The only
hint returned will be the first hint found that wins the game on the next play for the player. If it
does not find a hint, it returns {-1, -1}.
please follow this pseudo-code for the hint function:
For every row board
For every column on the board
If we can play at this row and column
Play the player’s piece
If the player has won the game
Remove the player’s piece from the last played location
Return the row and column of hint
Otherwise nobody has won game,
Remove the player’s piece from the last played location
Default return -1 for both row and column
Step by step
Solved in 2 steps
