Skip to main content

Candy Crush Saga developer to develop Call Of Duty mobile game

  


Recent reports says that candy crush saga creators are looking forward to create Call Of Duty mobile game, Company has mentioned the upcoming  project in their official website, saying "We are new king team, located in Stockholm Sweden, and we are working on very interesting project."

And for those who are unaware, King is a part of Activision Blizzard, the maker of Call Of Duty franchise. The company has open post for art director, level designer, senior system designer and system UX/UI designer.

Now focusing on the further action by the team,


The website further mentions that "Our challenge as a team is to create a Call of Duty experience on mobile that will strive to transform the best console experience fans know and love, while also breaking new ground for mobile and redefining the genre. Our approach and ambition is to be fresh, social, and highly accessible, while providing a very genuine game experience. The team will prototype extensively, has the freedom to think outside the box, and be encouraged to stretch their expertise in ways to create surprising results."

And for the ones who love Call of Duty, you must know that Call Of Duty game franchise will be converted into movies. The Guardian reported both Stacy Sher, a movie producer and Nick van Dyk, co-president of Activision saying that all the movies will be taking place in different eras the games are set in.

"We have plotted out many years," She said to the news website. "We put together this group of writers to talk about where we were going. There'll be a film that feels more like Black Ops, the story behind the story. The Modern Warfare series looks at what it's like to fight a war with the eyes of the world on you. And then maybe something that is more of a hybrid, where you are looking at private, covert operations, while a public operation is going on."


Comments

Popular posts from this blog

How to bypass Android pattern lock using CMD.

Many of you have encountered the situation where you forget your phone's pattern lock. This is totally common and we can't deny this. Then after trying all the combinations in mind and losing hope we just choose to reset our phone. But here I am providing you with the solution to this problem. You can just open up your phone following these few steps and without undergoing any trouble of losing your data and wasting your time.  Yes, I am talking about bypassing the pattern lock you used to unlock your phone. This procedure will be done using CMD. CMD, also known as command prompt is an amazing tool provided in Windows OP. You can control your entire computer using CMD which includes copying files from one folder to another, hiding your files, checking details of connected wireless devices and even shutting down your PC. You just need to learn some easy commands. How to bypass Pattern lock on your Android Phone? Before trying to Bypass the pattern lock...

1721 - Swapping Nodes in a Linked List.

Hi, Today we will be solving leetcode qs 1721 - Swapping Nodes in a Linked List. This qs is really simple. We need to swap the nodes placed at k distance from the start and end of the Linked List. So let's suppose you have a Linked List input as follows: 1 -> 2-> 4 -> 5 -> 7 -> 8 -> 10-> 9  and you are given a k = 2, so the output should be 1 -> 10 -> 4 -> 5 -> 7 -> 8 -> 2 -> 9 so how do we achieve it??? Intuition The most brute force solution one can think of is using Array data structure. For that, we will traverse through linked List and store all the elements in the Array, swap the two numbers and again insert it in theLinked List again. Not bad, but let's deal with it, it is not the optimal solution and far from being as an acceptable solution in interviews. So what can we done instead of that??? Let's try to look deep into the working of Linked List first and how do we traverse it. Linked List is a linear data structure that...

1235. Maximum Profit in Job Scheduling

Hi everyone, Today's post is little bit intriguing to me as it took me some time to get t the solution. I have been out of practice for a bit so I was not able to do it in the DP. I didn't want to copy the code. Though i understood the code after i checked its solution in the discussions. Anyways, i tried to do it with heap and with some thinking I was able to do it and with my surprise It performed real well. I would like to jump to the solution but first I would like to explain a little bit about heaps so you can get better understanding of the code. A heap is like a special type of list where the smallest (or largest) item is always at the front. Think of it like a priority line at a theme park, where the person with the highest priority goes to the front. There are two types of heaps: Min Heap: The smallest item is at the front. It's like standing in a line where the shortest person is always at the front. Max Heap: The largest item is at the front. It's like stand...