ScratchData LogoScratchData
Back to asherscratch3's profile

A* search algorithm

ASasherscratch3•Created September 17, 2024
A* search algorithm
2
2
17 views
View on Scratch

Instructions

按Enter鍵開始搜尋路徑 按空白鍵進入編輯模式,再按一次以清除全部 在空白處長按並拖曳以繪製牆壁,在牆壁長按拖曳以清除牆壁 鼠標滑至右上角可以更改模式: 模式1:只能橫向及直向移動 模式2:可對角線移動 模式3:可對角線移動,但距離為√2 倍 Press Enter to start searching for paths Press the space bar to enter edit mode, press again to clear all Long press and drag on an empty space to draw a wall, long press and drag on a wall to clear it Slide the mouse to the upper right corner to change the mode: Mode 1: Can only move horizontally and vertically Mode 2: Can move diagonally Mode 3: Can move diagonally, but the distance is √2 times

Description

A*搜尋演算法(A* search algorithm)是一種在圖形平面上,有多個節點的路徑,求出最低通過成本的演算法。 (摘自維基百科) The A* search algorithm is an algorithm that finds the lowest pass cost for paths with multiple nodes on the graphics plane. (Excerpted from Mandarin Wikipedia)

Project Details

Project ID1068748553
CreatedSeptember 17, 2024
Last ModifiedDecember 1, 2024
SharedNovember 30, 2024
Visibilityvisible
CommentsAllowed