Suppose that you want to implement an algorithm tht will compete on a two-player deterministic game of perfect information. Your opponent is a supercomputer called DeepGreen. DeepGreen does not use Minimax. You are given a library function DeepGreenMove(S), that takes any state S as an argument, and returns the move that DeepGreen will choose for that state S (more precisely, DeepGreenMove (S) returns the state resulting from the opponent's move). Write an algorithm in pseudocode (following the style of the Minimax pseudocode) that will always make an optimal decision given the knowledge we have about DeepGreen. You are free to use the library function DeepGreenMove(S) in your pseudocode. If you think regular Minimax is the answer, just state so.

well cos like a ds it doesn't really die out, unlike for example, fifa, they always come out with a new version, so lets say your fifa 18 is charging you to update the teams and stuff, so, if messi were to go to real madrid (never gonna happen) it would switch messi to the other team, until the owners of fifa come out with fifa 19, then the game would eventually stop updating, and back to the ds, it doesn't really stop working after sometime because there's lots of things that it could be used for, and idk if u know what i'm saying, but long story short, samsung, represents the ds, if they still work, and people love them but not the new version, the old version still works, so they don't really force people to buy new phones, get me?

do not use any of these common illegal characters/symbols:

# pound

% percent

& ampersand

{ left curly bracket

} right curly bracket

\ back slash

< left angle bracket

> right angle bracket

* asterisk

? question mark

/ forward slash

  blank spaces

$ dollar sign

! exclamation point

' single quotes

" double quotes

: colon

@ at sign