Timeline for Breadth-First Search heuristics to find solution to Water Jug Challenge
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 22, 2015 at 11:51 | history | edited | Namit Sinha | CC BY-SA 3.0 |
added 166 characters in body
|
| Aug 21, 2015 at 8:48 | answer | added | sunny | timeline score: 1 | |
| Aug 21, 2015 at 5:59 | answer | added | Renzo | timeline score: 3 | |
| Aug 21, 2015 at 4:22 | comment | added | Namit Sinha | @LokiAstari normally i would use Python to write these programs, but because of having some experience in c++ i knew this particular problem/solution would be easier to portray in c++ than in python at-least for me. | |
| Aug 21, 2015 at 1:50 | comment | added | Jerry Coffin | One interesting change would be to show all equally good solutions (e.g., using your notation: (0, 0), (0, 4), (3, 1), (0, 1), (1, 0), (1, 4), (3, 2) uses the same number of steps). | |
| Aug 20, 2015 at 20:23 | comment | added | Loki Astari | Not using C++ for AI work would be a good start. There are languages specifically designed for writing AI that provide semantics that are more natural to express these problems. | |
| Aug 20, 2015 at 20:12 | history | edited | Jamal | CC BY-SA 3.0 |
deleted 24 characters in body; edited title
|
| Aug 20, 2015 at 20:06 | history | asked | Namit Sinha | CC BY-SA 3.0 |