René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"BotClean Stochastic (Any language)","articleBody":"A deterministic environment is one where the next state is completely determined by the current state of the environment and the task executed by the agent. If there is any randomness involved in determining the next state, the environment is stochastic.\r\n\r\nThe game [Bot Clean](https://www.hackerrank.com/challenges/botclean) took place in a deterministic environment. In this version, the bot is given 200 moves to clean as many dirty cells as possible. The grid initially has 1 dirty cell. When the bot cleans this cell, a new cell in the grid is made dirty. The new cell can be anywhere in the grid.\r\n\r\nThe bot here is positioned at the top left corner of a 5*5 grid. Your task is to move the bot to appropriate dirty cell and clean it.\r\n\r\nInput Format\r\nThe first line contains two single spaced integers which indicates the current position of the bot. The grid is indexed (x, y) 0\u003c=x,y\u003c=4 top to bottom and left to right respectively. Refer to to [board convention here.](https://www.hackerrank.com/scoring/board-convention)\r\n\r\n5 lines follow showing the grid rows. Each cell in the grid is represented by any of the following 3 characters:\r\n\r\n'b' (ascii value 98) - the bot's current position (if on clean cell).\r\n\r\n'd' (ascii value 100) - a dirty cell (even if the robot is present on top of it).\r\n\r\n'-' (ascii value 45) - a clean cell in the grid.\r\n\r\nSample Input\r\n\r\n0 0\r\nb---d\r\n-----\r\n-----\r\n-----\r\n-----\r\nOutput Format\r\n\r\nOutput is the action that is taken by the bot in the current step and it can be any of the movements in 4 directions or cleaning the cell in which it is currently located. The output formats are LEFT, RIGHT, UP and DOWN or CLEAN. Output CLEAN to clean the dirty cell. Repeat this process until all the cells on the grid are cleaned.\r\n\r\nSample Output\r\n\r\nRIGHT\r\nResultant State\r\n\r\n-b--d\r\n-----\r\n-----\r\n-----\r\n-----\r\nThe bot is positioned now at (0,1) and is 1 step closer to the dirty cell. The next input will be\r\n\r\n0 1\r\n-b--d\r\n-----\r\n-----\r\n-----\r\n-----\r\nTask\r\n\r\nComplete the function nextMove that takes in 3 parameters posr, posc being the co-ordinates of the bot’s current position and board which indicates the board state, and print the bot’s next move.\r\n\r\nScoring\r\n\r\nAt the end of 200 moves, your score will be equal to the number of dirty cell the bot has cleaned divided by 4.","author":{"url":"https://github.com/ArmanKumar21","@type":"Person","name":"ArmanKumar21"},"datePublished":"2022-10-14T13:53:56.000Z","interactionStatistic":{"@type":"InteractionCounter","interactionType":"https://schema.org/CommentAction","userInteractionCount":4},"url":"https://github.com/101/python-cpp-html-programs-projects/issues/101"}