There is a useful heuristic in Go where if a move creates a connection that's too weak, then often if you "pull the move back" a space, usually creating a knight's move, you get a connection that works.
For example, in the following position, ''a'' does not work for black because white can push and cut at ''b'' and capture either the corner or the outside. But if black pulls his stone a step further away from white and plays the knight's move at ''c'' instead, then he produces a safe connection.
$$B
$$ ------------------
$$ | . . . . . . . . .
$$ | . . . . c . . . .
$$ | . X X b a . . . .
$$ | . X O O . O . . .
$$ | . O O . . . . . .
$$ | . . X . . . . . .
$$ | . . . . . . . . .
$$ | . . . . . . . . .
- Click Here To Show Diagram Code
[go]$$B
$$ ------------------
$$ | . . . . . . . . .
$$ | . . . . c . . . .
$$ | . X X b a . . . .
$$ | . X O O . O . . .
$$ | . O O . . . . . .
$$ | . . X . . . . . .
$$ | . . . . . . . . .
$$ | . . . . . . . . .[/go]
Similarly in this classic tesuji, ''a'' doesn't work for black, but ''b'' does.
$$B
$$ ------------------
$$ | . . . . . . . . .
$$ | . . . b . . . . .
$$ | . . . a . X X . .
$$ | . . X O O O . . .
$$ | . X X . . . . . .
$$ | . X O . O . . . .
$$ | . O O . . . . . .
$$ | . . . . . . . . .
- Click Here To Show Diagram Code
[go]$$B
$$ ------------------
$$ | . . . . . . . . .
$$ | . . . b . . . . .
$$ | . . . a . X X . .
$$ | . . X O O O . . .
$$ | . X X . . . . . .
$$ | . X O . O . . . .
$$ | . O O . . . . . .
$$ | . . . . . . . . .[/go]
In your example, looking at the two marked black stones, the one on the top side is weaker. So applying the heuristic, your first instinct should be ''a'', pulling the netting move back into a knight's move on the weak side. As opposed to ''b'', which makes the gap on the weak side even larger (two spaces instead of one space) and therefore even easier to for white to break through.
$$B
$$ ------------------
$$ | . . . . . . . . .
$$ | . . X X . . . . .
$$ | . X O O B . . . .
$$ | . X . O . . . . .
$$ | . . B . . a . . .
$$ | . . . . b . . . .
$$ | . . . . . . . . .
$$ | . . . . . . . . .
- Click Here To Show Diagram Code
[go]$$B
$$ ------------------
$$ | . . . . . . . . .
$$ | . . X X . . . . .
$$ | . X O O B . . . .
$$ | . X . O . . . . .
$$ | . . B . . a . . .
$$ | . . . . b . . . .
$$ | . . . . . . . . .
$$ | . . . . . . . . .[/go]