Minesweeper Queens

In the diagrams below, place the required number of mines.  The numbered squares are empty, from which the given number of mines can be attacked by a chess queen.  As in standard chess, a queen can attack in eight directions, and only one mine in a single direction.
Example.  The first diagram shows an unsolved puzzle.  The next shows the solution and the third fills in how many mines can be attacked from each empty square.  
        2
1 2 3 4  
  1      
 
        2
1 2 3 4 *
  1 * * *
 
1 1 2 2 2
1 2 3 4 *
1 1 * * *

Puzzle 1: Place 5 Mines.

1       2
      4  
      3  

Puzzles 2-4: Place 10 Mines.

         
0        
         
1        
         
 
    3    
    4    
4   3   1
    4    
    2    
 
         
1        
    7    
      4  
  5      

Source: Original.
Solutions were received from Pedro P. Romero, Philippe Fondanaiche, Alan O'Donnell, Claudio Baiocchi, and Cleverley Graham.  I had thought there were only unique solutions, but I was proven wrong.  The various solutions are below.

The Example has an additional solution.

    *   2
1 2 3 4 *
  1   * *

Puzzle 1 has four solutions.

1       2
  *   4 *
  * * 3 * 
 
1 * *   2
    * 4 *
      3 *
 
1 * * * 2
    * 4  
      3 *
 
1 * * * 2
    * 4 *
      3  

Puzzle 2 has a unique solution.

    *   *
0        
    * * *
1 *   * *
    *   *

Puzzle 3 has four solutions.

* * 3 *  
* * 4    
4 * 3   1
*   4    
* * 2 *  
 
*   3 * *
* * 4   *
4   3   1
* * 4    
* * 2    
 
* * 3   *
* * 4   *
4   3   1
* * 4    
* * 2    
 
* * 3 * *
* * 4   *
4   3   1
  * 4    
* * 2    

Puzzle 4 has a unique solution.

    * * *
1        
*   7 *  
* *   4  
* 5 *   *
Mail to Ken