Consider an n × n environment with locations (i, j), i = 1, . . . , n, j =
1, . . . , n. A miner named Sue begins at location (1, 1) and can travel up, left, down,
or right, provided that she remains within the environment at all times. There is
a gold mine at location (n, 1) and miner’s home at location (1, n). Sue begins with
0 coins in her backpack. Each time she visits the mine, she can get one gold. The
maximum amount of gold that Sue can carry is given by some constant integer G > 0.
Sue and the gold mine cannot be on the same location (n, 1); instead Sue “visits”
the gold mine by first traveling to a location that is adjacent to the gold mine (either
(n − 1, 1) or (n, 2)) and then taking an action that would place herself on the mine.
This results in Sue acquiring one more gold provided that she is not carrying G golds
already, and meanwhile, Sue’s location remains the same. Sue can visit her home
whenever she wants, similarly by first traveling to a location that is adjacent to her
home, and taking an action that would place herself on top of her home. This results
in Sue unloading all the gold she carries to her home. She receives the amount of gold
she carries as the reward. Similarly, her location remains the same in this process.
5 freelancer chào giá trung bình$148 cho công việc này
Hi - This job looks like a good fit with my skill set and experience. I hold Bachelor of Computer Science and Master of Data Science Please see my profile and reviews for references.