diagmeet.note 1.0 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
  1. Here is a comparison matrix which shows a case in which
  2. it is possible for the forward and backward scan in `diag'
  3. to meet along a nonzero length of diagonal simultaneous
  4. (so that bdiag[d] and fdiag[d] are not equal)
  5. even though there is no snake on that diagonal at the meeting point.
  6. 85 1 1 1 159 1 1 17
  7. 1 2 3 4
  8. 60
  9. 1 2
  10. 1
  11. 2 2 3 4
  12. 71
  13. 3 3 4 5
  14. 85
  15. 4 3 4 5
  16. 17
  17. 5 4 5
  18. 1
  19. 6 4 5 6
  20. 183
  21. 7 5 6 7
  22. 10
  23. 8 6 7
  24. 1
  25. 9 6 7 8
  26. 12
  27. 7 8 9 10
  28. 13
  29. 10 8 9 10
  30. 14
  31. 10 9 10
  32. 17
  33. 10 10
  34. 1
  35. 10 9 10
  36. 1
  37. 8 10 10 10
  38. 183
  39. 8 7 9 9 9
  40. 10
  41. 7 6 8 9 8 8
  42. 1
  43. 6 5 7 7
  44. 1
  45. 5 6 6
  46. 1
  47. 5 5 5
  48. 50
  49. 5 4 4 4
  50. 1
  51. 4 3 3
  52. 85
  53. 5 4 3 2 2
  54. 1
  55. 2 1
  56. 17
  57. 5 4 3 2 1 1
  58. 1
  59. 1 0
  60. 85 1 1 1 159 1 1 17