Home > Back-end >  One of solving ah freshman term assignments (oh) with C language
One of solving ah freshman term assignments (oh) with C language

Time:09-26

Maze to smaller 4 * 4 or 5 * 5 up to 10 * 10 thank you oh!!!!!!

CodePudding user response:

This picture is really good, such as the original poster write programs come out and have a look

CodePudding user response:

This maze is too simple, depth first and breadth-first could do it, don't have to use A * solution

CodePudding user response:

refer to the second floor and 蘤 old crepe reply:
this maze is too simple, depth first and breadth-first could do it, don't have to use A * solution
didn't learn what priority

CodePudding user response:

reference CQUPT - YYJ reply: 3/f
Quote: refer to the second floor and 蘤 old crepe reply:
this maze is too simple, depth first and breadth-first could do it, don't have to use A * solution
didn't learn what priority


Depth first and breadth-first thoughts, recursive implementation, the least of their brains, not learned check immediately
Can you have the interest to look it up in the A *, game algorithms for pathfinding, and much higher efficiency than the two above, write up A little trouble

CodePudding user response:

reference 4 floor with 蘤 old crepe response:
Quote: refer to the third floor CQUPT - YYJ reply:

Quote: refer to the second floor and 蘤 old crepe reply:
this maze is too simple, depth first and breadth-first could do it, don't have to use A * solution
didn't learn what priority


Depth first and breadth-first thoughts, recursive implementation, the least of their brains, not learned check immediately
Can you have the interest to look it up in the A *, game algorithms for pathfinding, and much higher efficiency than the two above, write up A little trouble point
?? ?? the

CodePudding user response:

reference 4 floor with 蘤 old crepe response:
Quote: refer to the third floor CQUPT - YYJ reply:

Quote: refer to the second floor and 蘤 old crepe reply:
this maze is too simple, depth first and breadth-first could do it, don't have to use A * solution
didn't learn what priority


Depth first and breadth-first thoughts, recursive implementation, the least of their brains, not learned check immediately
Can you have the interest to look it up in the A *, game algorithms for pathfinding, and much higher efficiency than the two above, write up A little trouble point
good thank you

CodePudding user response:

Can have a look at the article "C big supermarket management system of operation" https://www.weupgo.cn/? P=545, he explained the quite good

CodePudding user response:

Can have a look at the article "C big supermarket management system of operation" https://www.weupgo.cn/? P=545, source explained
  • Related