Jackals and Coyotes?
Determine the minimum number of river crossings.
Favorite Answer
1. 1 Jackal (J) and 1 Coyote (C) cross from side A to B (leaving 2 C & 2 J on side A)
2. 1 C returns to side A from B (1J on side B and 2J and 3C on side A)
3. 2 J cross to side B (3C on side A and 3 J on side B)
4. 1 J return to side A (3C and 1J on side A, 2 J on side B)
5. 2 C cross to side B (1J and 1C on side A, 2J and 2C on side B)
6. 1C and 1J cross to side A (2J and 2C on side A, 1J and 1C on side B)
7. 2C cross to side B (2J on side A, 1J and 3C on side B)
8. 1J cross to side A (3J on side A, 3C on side B)
9. 2J cross to side B (1J on side A, 2J and 3C on side B)
10. 1J cross to side A (2J on side A, 1J and 3C on side B)
11. 2J cross to side B (all on side B)
- Academic Writing
- Accounting
- Anthropology
- Article
- Blog
- Business
- Career
- Case Study
- Critical Thinking
- Culture
- Dissertation
- Education
- Education Questions
- Essay Tips
- Essay Writing
- Finance
- Free Essay Samples
- Free Essay Templates
- Free Essay Topics
- Health
- History
- Human Resources
- Law
- Literature
- Management
- Marketing
- Nursing
- other
- Politics
- Problem Solving
- Psychology
- Report
- Research Paper
- Review Writing
- Social Issues
- Speech Writing
- Term Paper
- Thesis Writing
- Writing Styles