Rules: Fill the grid with digits from 1 to n (1-6 for the example) so that no digit is repeated within a row or column. Numbers outside the grid indicate the sums of the digits in the corresponding directions, in order. There must be at least one blackened square between the sums, and all blackened cells should form the given Battleships fleet. The ships cannot touch each other, not even diagonally.
Background: This is one of my inventions. Honestly, I don’t prefer to mean “my” because of a simple combination of two classic types. So maybe I can say that JS and Battleships combination idea came from my wrinkled brain, only a simple idea… Tetrominoes, Pentominoes might be used instead of battleships fleet as another variations.