diff options
| author | Alex Auvolat <alex.auvolat@ens.fr> | 2015-02-02 00:36:46 +0100 |
|---|---|---|
| committer | Alex Auvolat <alex.auvolat@ens.fr> | 2015-02-02 00:36:46 +0100 |
| commit | 5a91fdc1a3d4b140d75bd96a0bdf308de6789478 (patch) | |
| tree | 8e16379370618d93ab8a2b16f6f0233db4f6a0a3 /problem.hpp | |
| parent | 8d0312f1e4d348e8e2fd1f7198770f34f1d3a2b9 (diff) | |
| download | Robotique-Projet-5a91fdc1a3d4b140d75bd96a0bdf308de6789478.tar.gz Robotique-Projet-5a91fdc1a3d4b140d75bd96a0bdf308de6789478.zip | |
Look for more solutions
Diffstat (limited to 'problem.hpp')
| -rw-r--r-- | problem.hpp | 2 |
1 files changed, 2 insertions, 0 deletions
diff --git a/problem.hpp b/problem.hpp index 4933ed6..e51b722 100644 --- a/problem.hpp +++ b/problem.hpp @@ -92,6 +92,8 @@ struct solution { // simple direct solution from A to B, takes into account no obstacles static std::vector<solution> direct_sol(const hilare_a &pos_a, const hilare_a &pos_b); + // same but try to rotate a bit before and after + static std::vector<solution> direct_sol_r(const hilare_a &pos_a, const hilare_a &pos_b); // check if a solution intersects an obstacle of problem bool intersects(const problem &p) const; |