{"id":8840,"date":"2023-11-08T09:11:21","date_gmt":"2023-11-08T03:41:21","guid":{"rendered":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/"},"modified":"2025-01-31T02:20:46","modified_gmt":"2025-01-30T20:50:46","slug":"a-search-algorithm-in-artificial-intelligence","status":"publish","type":"post","link":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/","title":{"rendered":"What is A* Search Algorithm?"},"content":{"rendered":"\n<p>In the world of <a href=\"https:\/\/www.mygreatlearning.com\/blog\/what-is-artificial-intelligence\/\">artificial intelligence,<\/a> graph traversal and pathfinding problems are common terminologies we encounter. Pathfinding algorithms use maps, grids and graphs to find optimal paths, specifically in games, robotics and navigation devices. Among all optimal solutions, A* Search Algorithm is a powerful tool.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"what-is-a-search-algorithm\">What is A* Search Algorithm?<\/h2>\n\n\n\n<p>The A* Search Algorithm is an optimal and efficient method for solving pathfinding problems. When seeking the <strong>shortest path<\/strong> between a starting point and a goal, A* is often the best choice due to its versatility and robustness.<\/p>\n\n\n<figure class=\"wp-block-image aligncenter size-full zoomable\" data-full=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2020\/04\/a-star-implementation-1-1.png\"><img decoding=\"async\" width=\"473\" height=\"327\" src=\"http:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2020\/04\/a-star-implementation-1-1.png\" alt=\"A star Search Algorithm\" class=\"wp-image-14570\" srcset=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2020\/04\/a-star-implementation-1-1.png 473w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2020\/04\/a-star-implementation-1-1-300x207.png 300w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2020\/04\/a-star-implementation-1-1-218x150.png 218w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2020\/04\/a-star-implementation-1-1-100x70.png 100w\" sizes=\"(max-width: 473px) 100vw, 473px\" \/><\/figure>\n\n\n\n<p>Widely used in robotics, video games, and navigation systems, A* is one of the most important algorithms in graph traversal.<\/p>\n\n\n\n<p>Pathfinding involves finding a viable route between two points in a given space while adhering to a set of rules. The A* algorithm is known for identifying the most efficient path from one point to another.<\/p>\n\n\n\n<p>It combines the strengths of two powerful algorithms: <strong>Dijkstra\u2019s algorithm<\/strong> and <strong>Greedy Breadth-First Search<\/strong>. It is powerful as it optimizes the estimated and actual cost of reaching a goal.<\/p>\n\n\n\n    <div class=\"courses-cta-container\">\n        <div class=\"courses-cta-card\">\n            <div class=\"courses-cta-header\">\n                <div class=\"courses-learn-icon\"><\/div>\n                <span class=\"courses-learn-text\">Texas McCombs, UT Austin<\/span>\n            <\/div>\n            <p class=\"courses-cta-title\">\n                <a href=\"https:\/\/onlineexeced.mccombs.utexas.edu\/online-data-science-business-analytics-course\" class=\"courses-cta-title-link\">Post Graduate Program in Data Science with Generative AI: Applications to Business<\/a>\n            <\/p>\n            <p class=\"courses-cta-description\">Learn how to turn data into strategy in this UT Data Science and Business Analytics Course \u2014 now with a focus on Generative AI. Gain practical experience through 7 hands-on projects over a 7-month duration.<\/p>\n            <div class=\"courses-cta-stats\">\n                <div class=\"courses-stat-item\">\n                    <div class=\"courses-stat-icon courses-user-icon\"><\/div>\n                    <span>7 Hands-on Projects<\/span>\n                <\/div>\n                <div class=\"courses-stat-item\">\n                    <div class=\"courses-stat-icon courses-star-icon\"><\/div>\n                    <span>Duration: 7 months<\/span>\n                <\/div>\n            <\/div>\n            <a href=\"https:\/\/onlineexeced.mccombs.utexas.edu\/online-data-science-business-analytics-course\" class=\"courses-cta-button\">\n                Discover the Program\n                <div class=\"courses-arrow-icon\"><\/div>\n            <\/a>\n        <\/div>\n    <\/div>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"graph-representation\">Graph Representation<\/h2>\n\n\n\n<p>In a*, the space is represented as a graph, where nodes represent positions or states and edges represent transitions between states. Edges are associated with costs or a given set of rules. The algorithm moves from the first node to the goal in consideration of the least-cost path.<\/p>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"formula\">Formula&nbsp;<\/h3>\n\n\n\n<p>A* Search Algorithm\u2019s formula calculates the cost of reaching a particular node. The total cost of traversal is calculated as:<\/p>\n\n\n\n<p><strong>f(n)=g(n)+h(n)<\/strong><\/p>\n\n\n\n<p>Where:&nbsp;<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li>f(n) is the estimated total cost from the start node to the end goal via node <strong>n<\/strong>.<\/li>\n\n\n\n<li>g(n) is the actual cost from the start node to node <strong>n<\/strong>.<\/li>\n\n\n\n<li>h(n) is the heuristic cost (estimated cost) from node <strong>n <\/strong>to end node.<\/li>\n<\/ul>\n\n\n\n<p>This heuristic cost or the guess of the remaining cost to the end goal is this algorithm's additional function, making it optimal amongst all pathfinding algorithms.<\/p>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"how-does-the-a-algorithm-work\">How does the A* Algorithm work?<\/h2>\n\n\n\n<p>A step-by-step implementation of this A* algorithm is given below:<\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Initialization<\/strong>: The algorithm starts by placing the starting node in a priority queue. This priority queue, also known as an open list, contains all the nodes that have yet to be evaluated.<\/li>\n\n\n\n<li><strong>Evaluation<\/strong>: This is the selection process in which the node with the lowest f(n) value from the queue is chosen for further operations.<\/li>\n\n\n\n<li><strong>Expansion<\/strong>: The chosen node is evaluated by comparing it with its neighbours. For each neighbour, g(n) and h(n) values are calculated.<\/li>\n\n\n\n<li><strong>Update<\/strong>: If a neighbour has a lower f(n) value than the recorded one, it is updated to the open list.<\/li>\n\n\n\n<li><strong>Goal Check<\/strong>: The algorithm continues until the goal node is reached or the open list is empty, indicating no more path to traverse.<\/li>\n\n\n\n<li><strong>Reconstruction<\/strong>: After finding the goal node, the algorithm reconstructs the path by tracing from the goal to the start node.<\/li>\n<\/ol>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"python-implementation\">Python Implementation<\/h3>\n\n\n\n<p>The basic implementation of the A* algorithm in Python for a grid-based pathfinding problem is given below:<\/p>\n\n\n<div class=\"wp-block-syntaxhighlighter-code \"><pre class=\"brush: plain; title: ; notranslate\" title=\"\">\nimport heap\nclass Node:\ndef __init__(self, position, g, h):\nself.position = position\nself.g = g  # Actual cost from start to this node\nself.h = h  # Heuristic cost to goal\nself.f = g + h  # Total cost\nself.parent = None  # To reconstruct the path\ndef __lt__(self, other):\nreturn self.f &amp;lt; other.f\ndef a_star(grid, start, goal):\nopen_list = &#x5B;]\nclosed_list = set()\n    \nstart_node = Node(start, 0, abs(start&#x5B;0] - goal&#x5B;0]) + abs(start&#x5B;1] - goal&#x5B;1]))  # Manhattan distance as heuristic\nheapq.heappush(open_list, start_node)\n    \nwhile open_list:\ncurrent_node = heapq.heappop(open_list)\n        \nif current_node.position == goal:\npath = &#x5B;]\nwhile current_node:\npath.append(current_node.position)\ncurrent_node = current_node.parent\nreturn path&#x5B;::-1]  # Return reversed path\n        \nclosed_list.add(current_node.position)\n        \n# Check all 4 possible directions (up, down, left, right)\nneighbors = &#x5B;(0, 1), (1, 0), (0, -1), (-1, 0)]\n        \nfor neighbor in neighbors:\nneighbor_pos = (current_node.position&#x5B;0] + neighbor&#x5B;0], current_node.position&#x5B;1] + neighbor&#x5B;1])\n            \nif 0 &amp;lt;= neighbor_pos&#x5B;0] &amp;lt; len(grid) and 0 &amp;lt;= neighbor_pos&#x5B;1] &amp;lt; len(grid&#x5B;0]) and grid&#x5B;neighbor_pos&#x5B;0]]&#x5B;neighbor_pos&#x5B;1]] != &#039;X&#039; and neighbor_pos not in closed_list:\ng = current_node.g + 1\nh = abs(neighbor_pos&#x5B;0] - goal&#x5B;0]) + abs(neighbor_pos&#x5B;1] - goal&#x5B;1])\nneighbor_node = Node(neighbor_pos, g, h)\nneighbor_node.parent = current_node\nheapq.heappush(open_list, neighbor_node)\nreturn None  # No path found\n# Example grid and usage\ngrid = &#x5B;\n&#x5B;&#039;S&#039;, &#039;1&#039;, &#039;1&#039;, &#039;X&#039;, &#039;1&#039;],\n&#x5B;&#039;1&#039;, &#039;X&#039;, &#039;1&#039;, &#039;1&#039;, &#039;1&#039;],\n&#x5B;&#039;1&#039;, &#039;1&#039;, &#039;1&#039;, &#039;X&#039;, &#039;G&#039;]\n]\nstart = (0, 0)\ngoal = (2, 4)\npath = a_star(grid, start, goal)\nprint(&quot;Path found:&quot;, path)\n<\/pre><\/div>\n\n\n<h3 class=\"wp-block-heading\" id=\"explanation-of-the-above-code\">Explanation of the above code:<\/h3>\n\n\n<figure class=\"wp-block-image aligncenter size-full zoomable\" data-full=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-start-algorithm-example.png\"><img decoding=\"async\" width=\"452\" height=\"307\" src=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-start-algorithm-example.png\" alt=\"implementation of the A* algorithm in Python\" class=\"wp-image-104089\" srcset=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-start-algorithm-example.png 452w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-start-algorithm-example-300x204.png 300w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-start-algorithm-example-150x102.png 150w\" sizes=\"(max-width: 452px) 100vw, 452px\" \/><\/figure>\n\n\n\n<p><strong>Key Components<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Node Class<\/strong>: Represents a position in the grid with:\n<ul class=\"wp-block-list\">\n<li>position: Coordinates (x, y).<\/li>\n\n\n\n<li>g: Cost from start to this node.<\/li>\n\n\n\n<li>h: Heuristic cost to goal.<\/li>\n\n\n\n<li>f: Total cost (f = g + h).<\/li>\n\n\n\n<li>parent: Tracks the node's parent for path reconstruction.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>a_star Function<\/strong>:\n<ul class=\"wp-block-list\">\n<li><strong>Input<\/strong>: Grid, start position, goal position.<\/li>\n\n\n\n<li><strong>Process<\/strong>:\n<ul class=\"wp-block-list\">\n<li>Initializes a priority queue (open list) with the start node and a closed list to track processed nodes.<\/li>\n\n\n\n<li>Explores the current node's neighbours (up, down, left, right).<\/li>\n\n\n\n<li>Uses <strong>Manhattan distance<\/strong> as the heuristic (h).<\/li>\n\n\n\n<li>Adds valid neighbours to the open list, prioritizing nodes with the lowest f value.<\/li>\n<\/ul>\n<\/li>\n\n\n\n<li><strong>Output<\/strong>: Shortest path (list of coordinates) or None if no path exists.<\/li>\n<\/ul>\n<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"heuristics-in-a-search\">Heuristics in A* Search<\/h2>\n\n\n<figure class=\"wp-block-image aligncenter size-full zoomable\" data-full=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/heuristic-function-in-a-star.png\"><img decoding=\"async\" width=\"540\" height=\"363\" src=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/heuristic-function-in-a-star.png\" alt=\"Heuristics in A* Search\" class=\"wp-image-104091\" srcset=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/heuristic-function-in-a-star.png 540w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/heuristic-function-in-a-star-300x202.png 300w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/heuristic-function-in-a-star-150x101.png 150w\" sizes=\"(max-width: 540px) 100vw, 540px\" \/><\/figure>\n\n\n\n<p>Heuristics play a very important role in the A* Search Algorithm as they are used to find the estimated cost of reaching the goal from a given node. The accuracy of the heuristic is directly related to the optimality of the path that A* finds.&nbsp;<\/p>\n\n\n\n<p><strong>Generally used heuristics are:<\/strong><\/p>\n\n\n\n<ol class=\"wp-block-list\">\n<li><strong>Manhattan Distance<\/strong>: Used for grid-based pathfinding. Here, the diagonal moves are not allowed.<\/li>\n\n\n\n<li><strong>Euclidean Distance<\/strong>: It is used for situations where diagonal moves are allowed.<\/li>\n\n\n\n<li><strong>Chebyshev Distance<\/strong>: Used for grids where the cost of diagonal moves is the same as that of horizontal and vertical moves.<\/li>\n<\/ol>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"applications-of-a-search\">Applications of A* Search<\/h2>\n\n\n\n<p>As we have discussed above, A* Search Algorithm has many real-world applications, such as:<\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Pathfinding in Games<\/strong>: A* algorithm is used in Artificial Intelligence Video Games where Non-player characters, commonly known as bots, find the shortest path throughout the game.<\/li>\n\n\n\n<li><strong>Robotics<\/strong>: This algorithm also helps robots navigate through environments, avoiding obstacles.<\/li>\n\n\n\n<li><strong>GPS Navigation<\/strong>: This algorithm is preferred to find the best and most efficient route between two points.<\/li>\n\n\n\n<li><strong>Puzzle Solving<\/strong>: Puzzles where the target is to reach a goal from an initial position, such as 8-puzzle or sliding puzzles, take the help of A* Search Algorithm.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"advantages-and-disadvantages-of-a-search-algorithm\">Advantages and disadvantages of A* Search Algorithm<\/h2>\n\n\n<figure class=\"wp-block-image aligncenter size-full zoomable\" data-full=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-advantages-disadvantages.png\"><img decoding=\"async\" width=\"555\" height=\"450\" src=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-advantages-disadvantages.png\" alt=\"Advantages and disadvantages of A* Search Algorithm\" class=\"wp-image-104092\" srcset=\"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-advantages-disadvantages.png 555w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-advantages-disadvantages-300x243.png 300w, https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-advantages-disadvantages-150x122.png 150w\" sizes=\"(max-width: 555px) 100vw, 555px\" \/><\/figure>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"advantages\"><strong>Advantages:<\/strong><\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Optimal<\/strong>: This algorithm is optimal as it guarantees the shortest possible path.<\/li>\n\n\n\n<li><strong>Efficient<\/strong>: When an appropriate heuristic is used, it is faster than all other algorithms.<\/li>\n\n\n\n<li><strong>Flexible<\/strong>: The algorithm is available to adapt to various types of graphs and different heuristics.<\/li>\n<\/ul>\n\n\n\n<h3 class=\"wp-block-heading\" id=\"disadvantages\"><strong>Disadvantages:<\/strong><\/h3>\n\n\n\n<ul class=\"wp-block-list\">\n<li><strong>Heuristic Dependent<\/strong>: The performance of this algorithm is heavily dependent on the choice of heuristics.<\/li>\n\n\n\n<li><strong>Memory Intensive<\/strong>: This algorithm stores all the nodes in memory, which is not suitable for large graphs.<\/li>\n<\/ul>\n\n\n\n<h2 class=\"wp-block-heading\" id=\"conclusion\">Conclusion<\/h2>\n\n\n\n<p>A* Search Algorithm is one of the best algorithms used in <a href=\"https:\/\/www.mygreatlearning.com\/blog\/what-is-artificial-intelligence\/\">artificial intelligence<\/a> and <a href=\"https:\/\/www.mygreatlearning.com\/blog\/what-is-machine-learning\/\">machine learning<\/a>. It intelligently balances performance and efficiency. By combining the strengths of Dijkstra\u2019s algorithm with greedy breadth-first search, a* produces optimal results.<\/p>\n\n\n\n<p>The key role of heuristics in this algorithm is to allow it to calculate the estimated cost and prioritize paths.<\/p>\n\n\n\n<p><strong>Suggested:<\/strong> <a href=\"https:\/\/www.mygreatlearning.com\/ai\/free-courses\">Free Artificial Intelligence Courses<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Learn how the A* Search Algorithm combines Dijkstra\u2019s and Greedy Search to find optimal paths in AI, robotics, and games. Explore its components, applications, and how it works efficiently with heuristics.<\/p>\n","protected":false},"author":41,"featured_media":104094,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"default","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","ast-disable-related-posts":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"set","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[2],"tags":[36802],"content_type":[],"class_list":["post-8840","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-artificial-intelligence","tag-ai-algorithm"],"acf":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v27.3 (Yoast SEO v27.3) - https:\/\/yoast.com\/product\/yoast-seo-premium-wordpress\/ -->\n<title>What is A* Search Algorithm ?<\/title>\n<meta name=\"description\" content=\"Discover how the A* Search Algorithm efficiently finds the shortest path in AI, robotics, and gaming by combining Dijkstra\u2019s and Greedy Search.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"What is A* Search Algorithm?\" \/>\n<meta property=\"og:description\" content=\"Discover how the A* Search Algorithm efficiently finds the shortest path in AI, robotics, and gaming by combining Dijkstra\u2019s and Greedy Search.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/\" \/>\n<meta property=\"og:site_name\" content=\"Great Learning Blog: Free Resources what Matters to shape your Career!\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/GreatLearningOfficial\/\" \/>\n<meta property=\"article:published_time\" content=\"2023-11-08T03:41:21+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-01-30T20:50:46+00:00\" \/>\n<meta property=\"og:image\" content=\"http:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png\" \/>\n\t<meta property=\"og:image:width\" content=\"734\" \/>\n\t<meta property=\"og:image:height\" content=\"405\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"author\" content=\"Great Learning Editorial Team\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@https:\/\/twitter.com\/Great_Learning\" \/>\n<meta name=\"twitter:site\" content=\"@Great_Learning\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Great Learning Editorial Team\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"6 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/\"},\"author\":{\"name\":\"Great Learning Editorial Team\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#\\\/schema\\\/person\\\/6f993d1be4c584a335951e836f2656ad\"},\"headline\":\"What is A* Search Algorithm?\",\"datePublished\":\"2023-11-08T03:41:21+00:00\",\"dateModified\":\"2025-01-30T20:50:46+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/\"},\"wordCount\":978,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#organization\"},\"image\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/a-star-search-algorithm.png\",\"keywords\":[\"AI Algorithm\"],\"articleSection\":[\"AI and Machine Learning\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/\",\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/\",\"name\":\"What is A* Search Algorithm ?\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#primaryimage\"},\"image\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#primaryimage\"},\"thumbnailUrl\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/a-star-search-algorithm.png\",\"datePublished\":\"2023-11-08T03:41:21+00:00\",\"dateModified\":\"2025-01-30T20:50:46+00:00\",\"description\":\"Discover how the A* Search Algorithm efficiently finds the shortest path in AI, robotics, and gaming by combining Dijkstra\u2019s and Greedy Search.\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#primaryimage\",\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/a-star-search-algorithm.png\",\"contentUrl\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2023\\\/11\\\/a-star-search-algorithm.png\",\"width\":734,\"height\":405,\"caption\":\"What is A* Search Algorithm?\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/a-search-algorithm-in-artificial-intelligence\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Blog\",\"item\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"AI and Machine Learning\",\"item\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/artificial-intelligence\\\/\"},{\"@type\":\"ListItem\",\"position\":3,\"name\":\"What is A* Search Algorithm?\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#website\",\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/\",\"name\":\"Great Learning Blog\",\"description\":\"Learn, Upskill &amp; Career Development Guide and Resources\",\"publisher\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#organization\"},\"alternateName\":\"Great Learning\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#organization\",\"name\":\"Great Learning\",\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/06\\\/GL-Logo.jpg\",\"contentUrl\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/06\\\/GL-Logo.jpg\",\"width\":900,\"height\":900,\"caption\":\"Great Learning\"},\"image\":{\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#\\\/schema\\\/logo\\\/image\\\/\"},\"sameAs\":[\"https:\\\/\\\/www.facebook.com\\\/GreatLearningOfficial\\\/\",\"https:\\\/\\\/x.com\\\/Great_Learning\",\"https:\\\/\\\/www.instagram.com\\\/greatlearningofficial\\\/\",\"https:\\\/\\\/www.linkedin.com\\\/school\\\/great-learning\\\/\",\"https:\\\/\\\/in.pinterest.com\\\/greatlearning12\\\/\",\"https:\\\/\\\/www.youtube.com\\\/user\\\/beaconelearning\\\/\"],\"description\":\"Great Learning is a leading global ed-tech company for professional training and higher education. It offers comprehensive, industry-relevant, hands-on learning programs across various business, technology, and interdisciplinary domains driving the digital economy. These programs are developed and offered in collaboration with the world's foremost academic institutions.\",\"email\":\"info@mygreatlearning.com\",\"legalName\":\"Great Learning Education Services Pvt. Ltd\",\"foundingDate\":\"2013-11-29\",\"numberOfEmployees\":{\"@type\":\"QuantitativeValue\",\"minValue\":\"1001\",\"maxValue\":\"5000\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/#\\\/schema\\\/person\\\/6f993d1be4c584a335951e836f2656ad\",\"name\":\"Great Learning Editorial Team\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/02\\\/unnamed.webp\",\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/02\\\/unnamed.webp\",\"contentUrl\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/wp-content\\\/uploads\\\/2022\\\/02\\\/unnamed.webp\",\"caption\":\"Great Learning Editorial Team\"},\"description\":\"The Great Learning Editorial Staff includes a dynamic team of subject matter experts, instructors, and education professionals who combine their deep industry knowledge with innovative teaching methods. Their mission is to provide learners with the skills and insights needed to excel in their careers, whether through upskilling, reskilling, or transitioning into new fields.\",\"sameAs\":[\"https:\\\/\\\/www.mygreatlearning.com\\\/\",\"https:\\\/\\\/in.linkedin.com\\\/school\\\/great-learning\\\/\",\"https:\\\/\\\/x.com\\\/https:\\\/\\\/twitter.com\\\/Great_Learning\",\"https:\\\/\\\/www.youtube.com\\\/channel\\\/UCObs0kLIrDjX2LLSybqNaEA\"],\"award\":[\"Best EdTech Company of the Year 2024\",\"Education Economictimes Outstanding Education\\\/Edtech Solution Provider of the Year 2024\",\"Leading E-learning Platform 2024\"],\"url\":\"https:\\\/\\\/www.mygreatlearning.com\\\/blog\\\/author\\\/greatlearning\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"What is A* Search Algorithm ?","description":"Discover how the A* Search Algorithm efficiently finds the shortest path in AI, robotics, and gaming by combining Dijkstra\u2019s and Greedy Search.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/","og_locale":"en_US","og_type":"article","og_title":"What is A* Search Algorithm?","og_description":"Discover how the A* Search Algorithm efficiently finds the shortest path in AI, robotics, and gaming by combining Dijkstra\u2019s and Greedy Search.","og_url":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/","og_site_name":"Great Learning Blog: Free Resources what Matters to shape your Career!","article_publisher":"https:\/\/www.facebook.com\/GreatLearningOfficial\/","article_published_time":"2023-11-08T03:41:21+00:00","article_modified_time":"2025-01-30T20:50:46+00:00","og_image":[{"width":734,"height":405,"url":"http:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png","type":"image\/png"}],"author":"Great Learning Editorial Team","twitter_card":"summary_large_image","twitter_creator":"@https:\/\/twitter.com\/Great_Learning","twitter_site":"@Great_Learning","twitter_misc":{"Written by":"Great Learning Editorial Team","Est. reading time":"6 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#article","isPartOf":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/"},"author":{"name":"Great Learning Editorial Team","@id":"https:\/\/www.mygreatlearning.com\/blog\/#\/schema\/person\/6f993d1be4c584a335951e836f2656ad"},"headline":"What is A* Search Algorithm?","datePublished":"2023-11-08T03:41:21+00:00","dateModified":"2025-01-30T20:50:46+00:00","mainEntityOfPage":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/"},"wordCount":978,"commentCount":0,"publisher":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/#organization"},"image":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#primaryimage"},"thumbnailUrl":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png","keywords":["AI Algorithm"],"articleSection":["AI and Machine Learning"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/","url":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/","name":"What is A* Search Algorithm ?","isPartOf":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/#website"},"primaryImageOfPage":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#primaryimage"},"image":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#primaryimage"},"thumbnailUrl":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png","datePublished":"2023-11-08T03:41:21+00:00","dateModified":"2025-01-30T20:50:46+00:00","description":"Discover how the A* Search Algorithm efficiently finds the shortest path in AI, robotics, and gaming by combining Dijkstra\u2019s and Greedy Search.","breadcrumb":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#primaryimage","url":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png","contentUrl":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png","width":734,"height":405,"caption":"What is A* Search Algorithm?"},{"@type":"BreadcrumbList","@id":"https:\/\/www.mygreatlearning.com\/blog\/a-search-algorithm-in-artificial-intelligence\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Blog","item":"https:\/\/www.mygreatlearning.com\/blog\/"},{"@type":"ListItem","position":2,"name":"AI and Machine Learning","item":"https:\/\/www.mygreatlearning.com\/blog\/artificial-intelligence\/"},{"@type":"ListItem","position":3,"name":"What is A* Search Algorithm?"}]},{"@type":"WebSite","@id":"https:\/\/www.mygreatlearning.com\/blog\/#website","url":"https:\/\/www.mygreatlearning.com\/blog\/","name":"Great Learning Blog","description":"Learn, Upskill &amp; Career Development Guide and Resources","publisher":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/#organization"},"alternateName":"Great Learning","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/www.mygreatlearning.com\/blog\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/www.mygreatlearning.com\/blog\/#organization","name":"Great Learning","url":"https:\/\/www.mygreatlearning.com\/blog\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.mygreatlearning.com\/blog\/#\/schema\/logo\/image\/","url":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2022\/06\/GL-Logo.jpg","contentUrl":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2022\/06\/GL-Logo.jpg","width":900,"height":900,"caption":"Great Learning"},"image":{"@id":"https:\/\/www.mygreatlearning.com\/blog\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.facebook.com\/GreatLearningOfficial\/","https:\/\/x.com\/Great_Learning","https:\/\/www.instagram.com\/greatlearningofficial\/","https:\/\/www.linkedin.com\/school\/great-learning\/","https:\/\/in.pinterest.com\/greatlearning12\/","https:\/\/www.youtube.com\/user\/beaconelearning\/"],"description":"Great Learning is a leading global ed-tech company for professional training and higher education. It offers comprehensive, industry-relevant, hands-on learning programs across various business, technology, and interdisciplinary domains driving the digital economy. These programs are developed and offered in collaboration with the world's foremost academic institutions.","email":"info@mygreatlearning.com","legalName":"Great Learning Education Services Pvt. Ltd","foundingDate":"2013-11-29","numberOfEmployees":{"@type":"QuantitativeValue","minValue":"1001","maxValue":"5000"}},{"@type":"Person","@id":"https:\/\/www.mygreatlearning.com\/blog\/#\/schema\/person\/6f993d1be4c584a335951e836f2656ad","name":"Great Learning Editorial Team","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2022\/02\/unnamed.webp","url":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2022\/02\/unnamed.webp","contentUrl":"https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2022\/02\/unnamed.webp","caption":"Great Learning Editorial Team"},"description":"The Great Learning Editorial Staff includes a dynamic team of subject matter experts, instructors, and education professionals who combine their deep industry knowledge with innovative teaching methods. Their mission is to provide learners with the skills and insights needed to excel in their careers, whether through upskilling, reskilling, or transitioning into new fields.","sameAs":["https:\/\/www.mygreatlearning.com\/","https:\/\/in.linkedin.com\/school\/great-learning\/","https:\/\/x.com\/https:\/\/twitter.com\/Great_Learning","https:\/\/www.youtube.com\/channel\/UCObs0kLIrDjX2LLSybqNaEA"],"award":["Best EdTech Company of the Year 2024","Education Economictimes Outstanding Education\/Edtech Solution Provider of the Year 2024","Leading E-learning Platform 2024"],"url":"https:\/\/www.mygreatlearning.com\/blog\/author\/greatlearning\/"}]}},"uagb_featured_image_src":{"full":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png",734,405,false],"thumbnail":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-150x150.png",150,150,true],"medium":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-300x166.png",300,166,true],"medium_large":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png",734,405,false],"large":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png",734,405,false],"1536x1536":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png",734,405,false],"2048x2048":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm.png",734,405,false],"web-stories-poster-portrait":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-640x405.png",640,405,true],"web-stories-publisher-logo":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-96x96.png",96,96,true],"web-stories-thumbnail":["https:\/\/www.mygreatlearning.com\/blog\/wp-content\/uploads\/2023\/11\/a-star-search-algorithm-150x83.png",150,83,true]},"uagb_author_info":{"display_name":"Great Learning Editorial Team","author_link":"https:\/\/www.mygreatlearning.com\/blog\/author\/greatlearning\/"},"uagb_comment_info":1,"uagb_excerpt":"Learn how the A* Search Algorithm combines Dijkstra\u2019s and Greedy Search to find optimal paths in AI, robotics, and games. Explore its components, applications, and how it works efficiently with heuristics.","_links":{"self":[{"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/posts\/8840","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/users\/41"}],"replies":[{"embeddable":true,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/comments?post=8840"}],"version-history":[{"count":75,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/posts\/8840\/revisions"}],"predecessor-version":[{"id":111840,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/posts\/8840\/revisions\/111840"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/media\/104094"}],"wp:attachment":[{"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/media?parent=8840"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/categories?post=8840"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/tags?post=8840"},{"taxonomy":"content_type","embeddable":true,"href":"https:\/\/www.mygreatlearning.com\/blog\/wp-json\/wp\/v2\/content_type?post=8840"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}