At the JVET meeting in Rennes it was proposed in JVET-AH0144 to enable hierarchical subblock based search for DMVR in ECM. That approach required more search than DMVR in ECM. In this contribution the search has been simplified such that the worst case number of integer based searches when the proposal is used is less than for DMVR in ECM. This has been achieved by omitting search in a dimension that has a size of 16 or smaller until the last step of the hierarchical search. Furthermore, when the size of one of the dimensions is lower that the other dimension the granularity of the search in the smaller dimensions is aligned with the granularity of the larger dimension. Finally, the search in the last step is limited to +/- 7 instead of +/- 8 as in ECM.