Which of the following statements is true for Branch-and-Bound search?
- Underestimates of remaining distance may cause deviation from optimal path
- Overestimates can't cause right path to be overlooked
- Dynamic programming principle can be used to discard redundant partial paths
- All of the above