REINFORCEMENT LEARNING IS A POPULAR CONTEXT OF MACHINE LEARNING THAT AIMS AT IMPROVING THE BEHAVIOR OF AUTONOMOUS AGENTS THAT LEARN FROM INTERACTIONS WITH THE ENVIRONMENT. HOWEVER, IT IS OFTEN COSTLY, TIME CONSUMING, AND EVEN DANGEROUS. TO DEAL WITH THESE PROBLEMS, REWARD SHAPING HAS BEEN USED AS A POWERFUL METHOD TO ACCELERATE THE LEARNING SPEED OF THE AGENT. THE PRINCIPLE IDEA IS TO INCORPORATE A NUMERICAL FEEDBACK, OTHER THAN ENVIRONMENT REWARD, FOR THE LEARNING AGENT. HOWEVER, FINDING AN EFFICIENT POTENTIAL FUNCTION TO SHAPE THE REWARD IS STILL AN INTERESTING AREA OF RESEARCH. IN THIS PAPER, A NEW ALGORITHM HAS BEEN PROPOSED THAT RECEIVES THE ENVIRONMENT Graph, PERFORMS SOME NEW Analysis, AND PROVIDES THE EXTRACTED INFORMATION FOR THE LEARNING AGENT TO ACCELERATE THE SPEED OF LEARNING. THIS INFORMATION INCLUDES SUB GOALS, BAD STATES, AND SUB ENVIRONMENTS WITH DIFFERENT EXPLORATION, OR REWARD, VALUES. TO EVALUATE THIS ALGORITHM AN EXPERIMENTAL STUDY HAS BEEN CONDUCTED ON TWO BENCHMARK ENVIRONMENTS, SIX ROOMS AND MAZE. THE OBTAINED RESULTS DEMONSTRATE THE EFFECTIVENESS OF THE PROPOSED ALGORITHM.