Jih-tung Pai wrote:

I wonder if there is conclusion or consensus on whether to store
quiescence search results in hash table.

I think, there is no definite conclusion. I think many engine authors tried
it both ways. I for example use HTs in qsearch. Crafty for example, does
not.

What are the advantages and
disadvantages?

They should be rather obvious. Advantages - you can cut the trees or get a
reasonable move for move-ordering (even in normal search). Disadvantages:
complicates your qsearch function and adds processing time.

If I choose to store the results, is it better to store
in the same hash table as regular one or I should have separate one?

I use the same HT.

Regards,
Dieter