I bet you have seen a pebble solitaire game. You know the game where you are given a board with an arrangment of small cavities, initially all but one occupied by a pebble each. The aim of the game is to remove as many pebbles as possible from the board. Pebbles disappear from the board as a result of a move. A move is possible if there is a straight line of three adjacent cavities, let us call them 𝐴, 𝐵, and 𝐶, with 𝐵 in the middle, where 𝐴 is vacant, but 𝐵 and 𝐶 each contain a pebble. The move consists of moving the pebble from 𝐶 to 𝐴, and removing the pebble in 𝐵 from the board. You may continue to make moves until no more moves are possible.In this problem, we look at a simple variant of this game, namely a board with twelve cavities located along a line. In the beginning of each game, some of the cavities are occupied by pebbles. Your mission is to find a sequence of moves such that as few pebbles as possible are left on the board.Figure 1: In a) there are two possible moves, namely 8→6, or 7→9. In b) the result of the 8→6 move is depicted, and again there are two possible moves, 5→7, or 6→4. Making the first of these results in c), from which there are no further moves.InputThe input begins with a positive integer 𝑛≤10 on a line of its own. Thereafter 𝑛 different games follow. Each game consists of one line of input with exactly twelve characters, describing the twelve cavities of the board in order. Each character is either ‘-’ or ‘o’. A ‘-’ character denotes an empty cavity, whereas an ‘o’ character denotes a cavity with a pebble in it. There is at least one pebble in all games.OutputFor each of the 𝑛 games in the input, output the minimum number of pebbles left on the board possible to obtain as a result of moves, on a line of its own.Sample Input 1 Sample Output 15---oo--------o--o-oo-----o----ooo---oooooooooooooooooooooo-o123121

A game is played by moving a game piece left or right along a horizontal game board. The board consists of spaces of various colors, as shown. The circle represents the initial location of the game piece.Yellow Black Green Green Red Yellow Black Black Yellow Black                  ● The following algorithm indicates how the game is played. The game continues until the game is either won by landing on the red space or lost when the piece moves off either end of the board.Step 1:Place a game piece on a space that is not red and set a counter to 0.Step 2:If the game piece is on a yellow space, move the game piece 3 positions to the left and go to step 3. Otherwise, if the game piece is on a black space, move the game piece 1 position to the left and go to step 3. Otherwise, if the game piece is on a green space, move the game piece 2 positions to the right and go to step 3.Step 3:Increase the value of the counter by 1.Step 4:If game piece is on the red space or moved off the end of the game board, the game is complete. Otherwise, go back to step 2.If a game is begun by placing the game piece on the rightmost black space for step 1, what will be the value of the counter at the end of the game?Responses2233445

Given an integer ‘N’, you need to make the maximum possible number of moves where each move consists of choosing a positive integer ‘X’ > 1, such that ‘N’ is divisible by ‘X’ and replacing ‘N’ with ‘N/X’.When ‘N’ becomes equal to 1 and there are no more possible valid moves. You need to stop and your score is equal to the number of moves made.Given ‘N’ is of the form a! / b! ( i.e. factorial of ‘a’ divided by factorial of ‘b’) for some positive integer ‘a’ and ‘b’ (a ≥ b).You need to find and return the maximum possible score you can achieve.

There are n pieces arranged in a line, and each piece is colored either by 'A' or by 'B'. You are given a string colors of length n where colors[i] is the color of the ith piece.Alice and Bob are playing a game where they take alternating turns removing pieces from the line. In this game, Alice moves first.Alice is only allowed to remove a piece colored 'A' if both its neighbors are also colored 'A'. She is not allowed to remove pieces that are colored 'B'.Bob is only allowed to remove a piece colored 'B' if both its neighbors are also colored 'B'. He is not allowed to remove pieces that are colored 'A'.Alice and Bob cannot remove pieces from the edge of the line.If a player cannot make a move on their turn, that player loses and the other player wins.Assuming Alice and Bob play optimally, return true if Alice wins, or return false if Bob wins. Example 1:Input: colors = "AAABABB"Output: trueExplanation:AAABABB -> AABABBAlice moves first.She removes the second 'A' from the left since that is the only 'A' whose neighbors are both 'A'.Now it's Bob's turn.Bob cannot make a move on his turn since there are no 'B's whose neighbors are both 'B'.Thus, Alice wins, so return true.Example 2:Input: colors = "AA"Output: falseExplanation:Alice has her turn first.There are only two 'A's and both are on the edge of the line, so she cannot move on her turn.Thus, Bob wins, so return false.Example 3:Input: colors = "ABBBBBBBAAA"Output: falseExplanation:ABBBBBBBAAA -> ABBBBBBBAAAlice moves first.Her only option is to remove the second to last 'A' from the right.ABBBBBBBAA -> ABBBBBBAANext is Bob's turn.He has many options for which 'B' piece to remove. He can pick any.On Alice's second turn, she has no more pieces that she can remove.Thus, Bob wins, so return false.

Games where movement is determined by successful action or performanceQuestion 18Select one:a.Skills Gamesb.Tabletop or Miniature Gamesc.Board Games

Games where movement is determined by successful action or performanceQuestion 13Select one:a.Tabletop or Miniature Gamesb.Board Gamesc.Skills Games