Structuring depth-first search algorithms in Haskell

1995 ◽  
Author(s):  
David J. King ◽  
John Launchbury
Keyword(s):  
Search Algorithms ◽  
Depth First Search

Two Streamlined Depth-First Search Algorithms

1986 ◽  
Vol 9 (1) ◽  
pp. 85-94
Author(s):  
Robert Endre Tarjan
Keyword(s):  
Directed Graph ◽  
Graph Algorithms ◽  
Undirected Graph ◽  
Linear Time ◽  
Search Algorithms ◽  
Depth First Search ◽  
Time Graph

Many linear-time graph algorithms using depth-first search have been invented. We propose simplified versions of two such algorithms, for computing a bipolar orientation or st-numbering of an undirected graph and for finding all feedback vertices of a directed graph.

scholarly journals Artificial Intelligence based Pacman Game

2020 ◽  
Vol 9 (9) ◽  
pp. 140-144
Keyword(s):  
Artificial Intelligence ◽  
Video Game ◽  
Environmental Conditions ◽  
Search Algorithms ◽  
Breadth First Search ◽  
Artificial Intelligence Research ◽  
Depth First Search ◽  
Optimal Paths ◽  
Alpha Beta ◽  
Multi Agents

This paper is about implementing pacman game with AI.The Game Pac-Man is a very challenging video game that can be useful in conducting AI(Artificial Intelligence) research. Here,the reason we have implemented various AI algorithms for pacman game is that it helps us to study AI by using visualizations through which we can understand AI more ef- fectively.The main aim is to build an intelligent pacman agent which finds optimal paths through the maze to find a particular goal such as a particular food position,escaping from ghosts.For that, we have implemented AI search algorithms like Depth first search,Breadth first search,A*search,Uniform cost search.We have also implemented multi-agents like Reflex agent,Minimax agent,Alpha-beta agent.Through these multiagent algorithms,we can make pacman to react from its environmental conditions and escape from ghosts to get high score.We have also done the visualization part of the above AI algorithms by which anyone can learn and understand AI algorithms easily.For visualisation of algorithms,we have used python libraries matplotlib and Networkx.

scholarly journals SISTEM PAKAR DIAGNOSA PENYAKIT BAYI DAN BALITA BERBASIS ANDROID DENGAN MENGGUNAKAN ALGORITMA DEPTH FIRST SEARCH

Compiler ◽  
2014 ◽  
Vol 3 (2) ◽  
Author(s):  
Muhammad Syaifuddin ◽  
Anton Setiawan Honggowibowo
Keyword(s):  
Expert System ◽  
First Aid ◽  
Inference Engine ◽  
Search Algorithms ◽  
Disease Symptom ◽  
Infants And Toddlers ◽  
Disease Treatment ◽  
Depth First Search ◽  
Forward Chaining ◽  
Treatment And Prevention

It is a must for children (infants and toddlers) to get more attention due to their health because their body’s protections are not yet strong. This makes them susceptible for germs, bacteria, and viruses attacks. Those attacks cause disease. This disease symptom could appear all of sudden to the children. It makes their parents afraid, especially for those who have less sensitiveness for the symptom. For this reason, I make an application based on android smartphone expert system to provide information on type of disease, treatment, and prevention based on the symptoms given. This application uses forward chaining and backward chaining inference engine to make conclusion, and Depth First Search algorithms for searching the method. The result shows that this application could help parents in giving some information about common diseases attacked to infants and toddlers. This application facilitates them in delivering information which can be accessed anywhere as first aid for infants and toddlers who indicated disease.

Sign in / Sign up

Export Citation Format

Share Document