Will this bitcoin mining strategy work?
(2) Based on the previous block hash, I calculate the possible block
  header combinations of the nonce, the version number, the timestamp*
  and the Merkle root. The goal is to simply find a valid block header
  which has a lower hash value than the current target.


The block header is 80 bytes size:


version: 4 bytes.
previous hash: 32 bytes.
merkle root: 32 bytes.
time: 4 bytes.
bits: 4 bytes.
nonce: 4 bytes.


Miners iterate the nonce (4 bytes), and the fast ones the extranonce (4 bytes more). The other items are already known, they get them from the pool.

You propose to iterate nonce (4 byte) + version (4 byte) + merkle root (32 byte) to find a target hash faster than them. I belive it will not work.