{"push_id":2936964480,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"aec392bfbf78805b3868f6f304fc94a30a37e52e","before":"bbee3e12f7c1abe1ff77b26829965d41476f7b2a","commits":[{"sha":"aec392bfbf78805b3868f6f304fc94a30a37e52e","author":{"name":"arcticdreamz","email":"a28bfe4afd4e1556803dbe90ebb985b7768cad18@gmail.com"},"message":"Implement basic search agent using BFS (BUG)\n\nBUG : Only works for --layout small.\n\nThe BFS implementation of the search agent uses\nqueues and sets rather than doing things recursively, mainly\nto contain most of the code inside one function call, namely\nget_action().\n\nChecking legal actions individually  and each successor emerging\nfrom that action using getPacmanSuccesor(action) is better\nthan creating all successors at once using getPacmanSuccessors\nbecause it allows to add each one to the closed_set variable\nindividually.\n\nNote that what is added to the closed_set is the successor state\nand not the position. A position and a state differ, among other things,\nby the directions of the agent which is not included inside the position\nvariable.\nAlthough using the position in the small layout is optimal, this\nonly works because there is only one food source and Pacman never has\nto go back to the same position twice. This is not the case for the\nbigger layouts.","distinct":true,"url":"https://api.github.com/repos/tcrasset/Pacman/commits/aec392bfbf78805b3868f6f304fc94a30a37e52e"}]}
{"actor":{"display_login":"tcrasset"}}