.

🧠 Never forget 504 pieces of useful knowledge — ready when you need them. Just $30 a year.

One-click recall. Fully hosted and maintained. That’s 504 personalized websites for just 6 cents each.

✅ Just email us what you want to remember — we’ll handle the rest.

✅ Your website goes live in 24 hours — fully optimized for mobile and voice search.

✅ Built for memory recall and exam preparation.

🎯 Who It’s For

Anyone who believe forgetting is no longer an issue.

NEVER FORGET.
With IN-V-BAT-AI, your knowledge lives in the cloud —ready when you are.

IN-V-BAT-AI solution to forgetting! No coding. No website hosting.

Remember on demand is now possible!

Traveling Salesman Problem 6

Traveling Salesman Problem 6 Cities Calculator

Find the shortest distance route starting from City A and visiting all the remaining 5 cities just once and then return back to original starting point City A. There are 15 input distances and 120 possible combination to get the shortest route distance.

5

23

19

25

33

14

7

12

15

44

5

8

55

7

15

The reverse direction is also correct: Solution 109, AFEDCBA

See real time calculation:
Change distance b to e from 33 to 3. What is the shortest route? Answer = 42, solution 13, ABECDFA or the reverse direction solution 105, AFDCEBA

Change distance b to d from 44 to 4. What is the shortest route? Answer = 41, solution 12, ABDCEFA or the reverse direction solution 112, AFECDBA

Change distance a to b from 5 to 59. What is the shortest route? Answer = 86, solution 59, ADCBEFA or the reverse direction solution 113, AFEBCDA

This is interactive so try it. if the edge or line has no distance enter 1e9 (meaning 1,000,000,000) there is no available road to connect the two nodes. For example go to Drawing #1 example node A to node D no line so you enter 1e9 as input. (line is also called as edge, path, circuit in graph of traveling salesman analysis).

ENTER YOUR NEW DATA HERE

120 Possible combinations of car tour visiting all six (6) cities starting from city A as the default starting point and returning to the same starting point A. The travelling salesman problem is to find the shortest route distance. Another contraint of the problem that must be satisfied is you must visit each city once.

solution 1 A B C D E F A	solution 2 A B C D F E A	solution 3 A B C E D F A	solution 4 A B C E F D A
solution 5 A B C F D E A	solution 6 A B C F E D A	solution 7 A B D F E C A	solution 8 A B D F C E A
solution 9 A B D E C F A	solution 10 A B D E C F A	solution 11 A B D C F E A	solution 12 A B D C E F A
solution 13 A B E C D F A	solution 14 A B E C F D A	solution 15 A B E D C F A	solution 16 A B E D F C A
solution 17 A B E F D C A	solution 18 A B E F C D A	solution 19 A B F D E C A	solution 20 A B F D C E A
solution 21 A B F C D E A	solution 22 A B F C E D A	solution 23 A B F E C D A	solution 24 A B F E D C A
solution 25 A C B D E F A	solution 26 A C B D F E A	solution 27 A C B E F D A	solution 28 A C B E D F A
solution 29 A C B F E D A	solution 30 A C B F D E A	solution 31 A C D E F B A	solution 32 A C D E B F A
solution 33 A C D F E B A	solution 34 A C D F B E A	solution 35 A C D B E F A	solution 36 A C D B F E A
solution 37 A C E B D F A	solution 38 A C E B F D A	solution 39 A C E D B F A	solution 40 A C E D F B A
solution 41 A C E F B D A	solution 42 A C E F D B A	solution 43 A C F D E B A	solution 44 A C F D B E A
solution 45 A C F E B D A	solution 46 A C F E D B A	solution 47 A C F B E D A	solution 48 A C F B D E A
solution 49 A D B C E F A	solution 50 A D B C F E A	solution 51 A D B E C F A	solution 52 A D B E F C A
solution 53 A D B F E C A	solution 54 A D B F C E A	solution 55 A D C E B F A	solution 56 A D C E F B A
solution 57 A D C F B E A	solution 58 A D C F E B A	solution 59 A D C B E F A	solution 60 A D C B F E A
solution 61 A D E C B F A	solution 62 A D E C F B A	solution 63 A D E B C F A	solution 64 A D E B F C A
solution 65 A D E F B C A	solution 66 A D E F C B A	solution 67 A D F E B C A	solution 68 A D F E C B A
solution 69 A D F B E C A	solution 70 A D F B C E A	solution 71 A D F C B E A	solution 72 A D F C E B A
solution 73 A E C D B F A	solution 74 A E C D F B A	solution 75 A E C F D B A	solution 76 A E C F B D A
solution 77 A E C B D F A	solution 78 A E C B F D A	solution 79 A E D C B F A	solution 80 A E D C F B A
solution 81 A E D C B F A	solution 82 A E D C F B A	solution 83 A E D F C B A	solution 84 A E D F B C A
solution 85 A E F D B C A	solution 86 A E F D C B A	solution 87 A E F B D C A	solution 88 A E F B C D A
solution 89 A E F C B D A	solution 90 A E F C D B A	solution 91 A E B C D F A	solution 92 A E B C F D A
solution 93 A E B D C F A	solution 94 A E B D F C A	solution 95 A E B F C D A	solution 96 A E B F D C A
solution 97 A F C D E B A	solution 98 A F C D B E A	solution 99 A F C E B D A	solution 100 A F C E D B A
solution 101 A F C B E D A	solution 102 A F C B D E A	solution 103 A F D E B C A	solution 104 A F D E C B A
solution 105 A F D C E B A	solution 106 A F D C B E A	solution 107 A F D B E C A	solution 108 A F D B C E A
solution 109 A F E D C B A	solution 110 A F E D B C A	solution 111 A F E C B D A	solution 112 A F E C D B A
solution 113 A F E B C D A	solution 114 A F E B D C A	solution 115 A F B C E D A	solution 116 A F B C D E A
solution 117 A F B D E C A	solution 118 A F B D C E A	solution 119 A F B E D C A	solution 120 A F B E C D A

Additional Practice Exercises:


Drawing # 1

Input A	Input B	Input C	Input D
AB =4	AE =1e9	AD =1e9	AC =7
BE =1e9	BC =4	CD =5	CE =9
DE =3	BD =1e9	EF =5	AF =5
BF =1e9	DF =1e9	CF =1e9

Drawing # 1 Answer 26 Solution 1



Drawing # 2

Input A	Input B	Input C	Input D
AB =4	AE =1e9	AD =6	AC =7
BE =1e9	BC =4	CD =5	CE =9
DE =3	BD =6	EF =5	AF =5
BF =1e9	DF =5	CF =1e9

Drawing # 2 Answer 26 Solution 1, Zoo to Library and Library to Home was added



Drawing # 3

Input A	Input B	Input C	Input D
AB =5	AE =30	AD =1e9	AC =1e9
BE =1e9	BC =20	CD =2	CE =1e9
DE =2	BD =1e9	EF =15	AF =7
BF =10	DF =9	CF =15

Drawing # 3 Answer 51 Solution 1

Travelling Salesman 7 Cities

Travelling Salesman 5 Cities

Travelling Salesman 4 Cities

.

.

How can IN-V-BAT-AI be used in classrooms ?

The IN-V-BAT-AI solution can be a valuable tool in classrooms, enhancing both teaching and learning experience. Here are some ways it can be utilized:

⋆ Personalized Learning : By storing and retrieving knowledge in the cloud, students can access tailored resources and revisit concepts they struggle with, ensuring a more individualized learning journey.

⋆ Memory Support : The tool helps students recall information even when stress or distractions hinder their memory, making it easier to retain and apply knowledge during homework assignments or projects.

⋆ Bridging Learning Gaps : It addresses learning loss by providing consistent access to educational materials, ensuring that students who miss lessons can catch up effectively.

⋆ Teacher Assistance : Educators can use the tool to provide targeted interventions to support learning.

⋆ Stress Reduction : By alleviating the pressure of memorization, students can focus on understanding and applying concepts, fostering a deeper engagement with the material.

.

$120 per school

Tap here to learn more


Advertising

.

.