Skip to main content
Carlos Linares López's user avatar
Carlos Linares López's user avatar
Carlos Linares López's user avatar
Carlos Linares López
  • Member for 12 years, 1 month
  • Last seen more than a month ago
14 votes

How does consistency imply that a heuristic is also admissible?

13 votes

Shortest Path on an Undirected Graph?

11 votes

Is using a more informed heuristic guaranteed to expand fewer nodes of the search space?

11 votes

3SAT is NP-complete, however is 1SAT NP-complete?

10 votes

Dijsktra's algorithm applied to travelling salesman problem

10 votes
Accepted

How does an admissible heuristic ensure an optimal solution?

9 votes
Accepted

Variant of the knapsack problem

8 votes

Algorithms for Connect 4?

7 votes

Survey of informed search algorithms?

7 votes
Accepted

Linear time algorithm for finding $k$ shortest paths from $s$ to $t$

7 votes
Accepted

Bidirectional Dijkstra vs Dijkstra

6 votes
Accepted

Is there any published paper about automated planning software used in the ESA Rosetta mission?

6 votes

Comparison between IDA* and Recursive best first search

6 votes
Accepted

Are depth-first/breadth-first considered special cases of best-first?

6 votes

Dijkstra algorithm vs breadth first search for shortest path in graph

6 votes
Accepted

Artificial Intelligence: Condition for BFS being optimal

6 votes
Accepted

Why is Iterative-deepening A* optimal, even without monotonicity?

5 votes
Accepted

A* optimality of the expanded node

5 votes

Creating admissible heuristics from functions?

5 votes
Accepted

Heuristic for sokoban puzzle problem

5 votes
Accepted

A* to find the longest path in a directed cyclic graph

5 votes
Accepted

How to recognize a STRIPS planning problem has no solution?

5 votes
Accepted

Minimax algorithm when all the options are the same

5 votes
Accepted

Why do we prefer DFS to find connected components?

5 votes
Accepted

Data structure for A*'s "open" set

4 votes

Understanding Dijkstra's algorithms

4 votes

Dijkstra with bitwise OR of edge costs

4 votes

Heuristics for the $n$-puzzle

4 votes
Accepted

How to formally prove that if triangle inequality is satisfied in a bunch of edges, then each edge has a positive value?

4 votes

How Do Common Pathfinding Algorithms Compare To Human Process