XinyaoHu/gpt4-answer-to-GridPath-2d

# Topic: Using gpt4 api to solve the following question

A {x} * {y} grid map with {(x)*(y)} blue dots(with x from 0 to {x-1} and y from 0 to {y-1}) representing coordinates and lines connecting them. Each adjacent coordinate is connected by a blue straight line, either horizontally or vertically, and the distance of 1. The grid starts from (0,0) at the bottom left and goes up to {x-1} * {y-1} at the top right. Obstacles on the grid are represented by the absence of blue dots at specific coordinates, as well as the missing adjacent blue lines connecting them. The coordinates with obstacles are:(obs_coordinates) with x and y from 0 to {x-1}, corresponding to the coordinate system. Thus, I need to find the shortest path from (0,0)to {x-1} * {y-1} to solve this problem you are required 1. moving each step either horizontally or vertically and avoiding obstacles by distance of 1. 2. don't recap the problem, please get straight to solve it 3. you will get the history of this problem which you did before 4. only need text-based path coordinates results "

# Step 1: Generate random obstacles
1. Grid size: 3*3 to 11*11,Percentage of obstacles: 0%, 5%, 10%, 15%, 20%, 25%, Number of groups: 10 for each percentage

# Step 2: Use Dijkstra and Astar to find the shortest path

# Step 3: Use gpt4 api to find the shortest path

# Step 4: Format the gpt4 output: complete output and summary output

# Step 5: Compare Dijkstra/astar and gpt4 answer to evaluate if gpt4 answer is the shortest path
* we cannot tell the no path answer by code, you can check it manually
1. length should be equal to the length of Dijkstra
2. Bypass the obstacles
3. Start coordinate and end coordinate should be (0,0) and (x-1,y-1)
3. Each step should be 1

原始信息汇总

数据集概述

数据集描述

该数据集是一个网格地图，包含多个蓝色点及其连接线，用于表示坐标和路径。网格大小从3x3到11x11，每个坐标点从(0,0)到(x-1,y-1)。网格中存在障碍物，以特定坐标点的缺失及其连接线的缺失表示。

数据集生成步骤

1. 生成随机障碍：

   • 网格大小：3x3到11x11
   • 障碍物百分比：0%, 5%, 10%, 15%, 20%, 25%
   • 每种百分比的组数：10组

2. 使用Dijkstra和Astar算法寻找最短路径

3. 使用gpt4 api寻找最短路径

4. 格式化gpt4输出：

   • 完整输出
   • 摘要输出

5. 比较Dijkstra/Astar和gpt4答案：

   • 路径长度应与Dijkstra算法相等
   • 避开障碍物
   • 起点和终点分别为(0,0)和(x-1,y-1)
   • 每步距离为1