coursera game theory

Test instructions: A person to go from a to B can only go a cloth, b step, (a+b) step, you can go to the left or rightAsk at least a few steps to go to the output-1Can list equations Ax+by=a-bor ax+ (a+b) y=a-bor bx+ (a+b) y=a-bTo take the smallest of these three equations (X+y)According to AX+BY=GCD (A, B)When a-B is not a multiple of GCD, you cannot walk toThe solution of these three equations can be calculated by using EX_GCD, but this group is not the smallest one.Therefore, the intersection

Title: http://hzwer.com/1976.htmlAnalysis: First Orz HzwerFor the chocolate bar outside the box is the NIM game.So it's easy to think of the first step. It's best to remove the M-root chocolate bar from the box, making the chocolate bar different or 0, and the rest of the chocolate bar in the box can not be obtained by any means or 0 (actually M is the longest xor or 0 subsequence of all chocolate bars)So for the back, whether it is to eat outside the box, or take the inside of the box, will be

A SG function of a state is defined as a minimum nonnegative integer other than the SG value in which the state can be shifted one step to the state.It has the following properties: From the state of the SG value x, it can be transferred to the state of the SG value 0,1,..., x-1.Regardless of whether the SG value is increased or not, we can determine the winning and losing status by the different SG values of all current sub-games.A memory search is often used to calculate the SG function.#inclu

Title Link: BZOJ-2463Problem analysisThe solution to this problem is that since both of them take the optimal strategy, all the squares will eventually be taken. (why.. I don't know what to say. Which God Ben can tell me about Qaq)So.. It becomes the parity of judging n*n, which is to judge the parity of N.Code#include 　　[BZOJ-2463] [Zhongshan 2009] who can win? "Game Theory" "

1. Basic ideas:First of all, both sides are master and rational, each step is the overall best. Even if you lose, you have to go the global optimal, so that the least loss . Dynamic planning-each situation, the only one to determine a state, the situation can be different initial conditions of the start, or the same initial different piecesThe result is an integer score, the two sides scored high wins, standing in the initiator angle, each step is hoping to get the maximum score; stand in the

, he drove the road with a skew. On the fourth day, he drove to the company to report the problem. Today, he is the business director of the company. When you face a wall that is difficult to climb, you may wish to throw your hat over the wall first. Throwing a hat over the wall means you have no choice. In order to retrieve the hat, you have to go over the wall and have no way out! It is only in the face of this kind of no retreat that people will concentrate on moving forward. In a sense, it

Address: HDU 1847 This problem can be converted using NP state. First, 0 means that you cannot play the cards. Then, it is a winning state that can reach the "fail" state in one step. What cannot reach the "fail" state in one step is a "fail" state. The state transition equation can be introduced and then solved using DP. That is, the transition from a known state to an unknown state is a small transition to a large state. If its next step is not defeated, it will be defeated, that is, it must w

unintelligent students ~), In addition, Kiki takes the cards first. Who can win? Of course, no matter who wins cards are not a problem, it is important that the upcoming CET-4 can have a good state. Good luck in CET-4 everybody! The input data contains multiple test cases. Each test case occupies one row and contains an integer N (1 Output if Kiki can win, output "Kiki"; otherwise, output "Cici". The output of each instance occupies one line. Sample Input 13 Sample output KikiCici Authorlcy

Title: There are n different value coins lined up in a line. Two contestants take the 1 or 2 coins in turn from the left until they have no coins. Calculates the total value of two individual coins, and the person with the highest value wins.Please decide whether the first player is a loser or a winner.ExamplesReturns true for given array A = [1,2,2].Returns false for given array A = [1,2,4].The question was not read at first, awkwardTopic Analysis: Two contestants in turn on the left can choose