Advertisement

The Bent Pin Problem—I: Computer Search Methods

  • Richard R. ZitoEmail author
Chapter

Abstract

This chapter determines all possible short-circuit paths between any two pins of a complex connector that undergoes a bent pin event during the mating of its two halves. A computer search game theory strategy is used. Finally, short-circuit probabilities are calculated on the basis of the number of paths found, path lengths, and the probability of any pin contacting its neighbor.

References

  1. 1.
    Fitzpatrick, R. G. (2010). Raytheon Missile Systems, Tucson, Arizona, 85734, Private Communications.Google Scholar
  2. 2.
    Briggs, N. L., Lloyd, E. K., & Wilson, R. J. (1976). Graph theory 1736–1936 (pp. 22–27). Oxford: Clarendon Press.zbMATHGoogle Scholar
  3. 3.
    Ozarin, N. (2008, September–October). Journal of Systems Safety, 19–28.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Richard R. Zito Research LLCTucsonUSA

Personalised recommendations