hˈɛns, dˈɛdˈɛnd ᵻlˌɪmᵻnˈeɪʃən ɪz ɐ mˈɪɹɚɹ ˈɪmɪdʒ ʌv daɪnˈæmɪk pɹˈoʊɡɹæmɪŋ, ɪnwˌɪtʃ "ɡˈʊd" kˌɑːmbᵻnˈeɪʃənz ɑːɹ aɪdˈɛntᵻfˌaɪd ænd ɛksplˈoːɹd fˈɜːðɚ.
Hence, dead-end elimination is a mirror image of dynamic programming, in which "good" combinations are identified and explored further.