As the king is only able to move one square in any direction, would traditional chess computers potentially under-utilize search trees containing a string of king moves as it is computationally expensive?
valid question