How to implement the algorithm for placing ships on the field?

Question

Java

Good afternoon, I want to know how to write an algorithm for arranging ships so that they do not touch each other?
A 10x10 field is a 2D array of symbols
. Ships from normal naval combat:
4 cells
3 cells
2 cells
1 cell

Answer 1

Need random generation?
1. Randomly determine the position of the ship
2. Exclude occupied cells from the array, if there is no space and there are ships, you reset the field.
3. go to point 1 until you place all the ships.

Answer 2

Some too general question. Do you not understand how to check for neighboring empty cells in a two-dimensional array?
Create a function where you do this in a loop or with separate checks:
if (myarray[x+1,y]==1)
{
return false;
}
and check for all required sizes. You can cut it down a bit here.

Answer 3

The most important thing is that in a classic naval battle, if you place ships starting with a 4-deck, then two 3-deck, then three 2-deck and four single-deck, then there is always an arrangement of ships. This is easily proven. If you start with single-deck, you can get into a mess.
The four-deck is placed by choosing the direction - horizontal / vertical and choosing the initial cell - a total of 140 options.
You mark the occupied cells, the cells around the ship and proceed to the three-deck ones.
You run through unoccupied cells and try to check the possibility of placing the ship horizontally or vertically. Store all possible options in an array, and then choose one randomly.
Repeat until all ships are placed. Proof-of-Existence Deployment ensures that you always have a place to place your ship.