Name: 斜め勝ちアルゴ - Python 3 プログラミングチュートリアル p.12 (Diagonal Winning Algo - Python 3 Programming Tutorial p.12)
Uploaded: 2021-01-14T12:27:48.000Z
Duration: 21 min 55 s
Description: VoiceTubeの動画で発音を聞きながら英語表現を覚えよう！学べる英語：

Everybody welcome to Part 12 of the Python three basics tutorial.

We're going to learn a bounce, probably one more built in function and talk about how we conduce the the Diagonal victories now to do that.

Actually, you know, if you especially with your hard coded there is really only two ways someone could win diagonally so hard coating wise.

It's actually pretty easy to cover this one, so long as we're playing a three by three.

But I want to maintain the ability for our tick tack toe to be scalable, too, any size, so it's gonna be a little more complex.

But again, there's only two different ways in there.

Have a pattern to them, so let's go ahead and get into it.

So all I'm gonna do, I'm just gonna commented out again later.

But for now I want to work on a diagonal, so let's go ahead and add a diagonal win.

Once again, Player, too, is getting more place.

So So what are the two ways that someone could win?

Well, they could either get this spot, this spot, this spot.

Well, what would the indexes like, what with the game indexes be like this spot is 00 What's this one?

This would be to 011 again and zero to notice a pattern.

So, at least this way, parole, like the indexes, Are it just identical?

You just increments up by land of game, right?

You just go up by Len of game, the other one, You go down starting at, you know, Len of game.

So if in case that's not making any sense to you guys, you would just say if game 00 double equals and then we're just gonna go Boop and Boop and Boop.

Um, and we would have a final check about not equaling zero.

Um oh, I'm not worried about that right now.

And this would this would be 11 And then this would be too, too.

So getting 001122 definite pattern there.

And then again, this one would be, Let's say it could go either way, but, like 2011 or zero to run that winner.

But if we take away that win, no winner, okay?

And then what if we give, uh, won the victory in the other direction?

Okay, so pretty cool so we could do that.

I want to keep us, um, not hard coating things because it just it's just gonna bite you later.

So So let's go ahead and, um, make something a little more dynamic.

So first of all, how would we get, um how could we handle like, this case?

So these are two separate cases, and they really are.

One is going this way, and one is going this way.

So it's handle for the first case here because this one is the easiest.

So all we would really need to do is like, let's say we have a list of diagonals because basically the end of the day when we were doing verticals, we build a list and see if all the numbers are the same.

We didn't even have to build a list to see if there were all the same s.

So when we do diagonals again, we're just gonna build a list and see if our they all the same.

So we're gonna say diagonals is a list, and then we're gonna say four and we're say, I x to be index in range of the land of our game.

So that will be 012 As we've already seen.

All we need to do is diag dot upend and then we append game.

Not that whatever that was game and then that i x for index in i X again Really simple, then all we have to do.

I don't think you need to see the this thing, but basically, we're just going to use this logic again, and rather than check, it's going to be diag.

Cz Okay, so I'm not gonna run that again.

Sure enough, 111 if we pass it into this little functionality we have here which, by the way, we've already started repeating.

And when we run it through that sort of check logic, uh, it's gonna rain.

So that way was actually really, really easy.

And, um, so now let's do the other direction, because the other direction is going to be a little more challenging, but not much.

So let's say we want to go the other way.

So I'm gonna I could see what I want to do here.

Um, part of me knows we've got so many commented out blocks.

Just so the only thing you see on screen is the things that we're we're talking about.

So, uh, um, so we're gonna go the other way now, So how would we get, uh, you know, like basically one needs to go in order and we've already seen range Len game.

That's how we can go in order How can we go in reverse order?

So for, let's just say, um I don't know I in, uh Well, first it was range of Len of game.

We can actually reverse that around so we can use another built in function called Reversed.

Now, Prince, I Let's just run that real quick to 10 Done.

And again, as always, if you wanted to learn more about reversed, I mean, there's so much to learn about it.

Uh, but if you wanted to, you could check it out.

Also, I hopefully by this point, you've realized Oh, my God.

There's a lot of really helpful built in functions.

And again, you know, if you wanted to do reversed, can you think of a way you would do it yourself or range?

I mean, my implementation of range would not be a cz efficient as their implementation or Len or whatever, but, um, if you wanted to do it, you could.

And for most of these, I'll see if they're doing it here.

Uh, they don't usually someone around here.

A lot of times you'll see the actual code, Um, that they used to actually produce the thing, but I don't see here anyways.

字幕リスト動画再生

斜め勝ちアルゴ - Python 3 プログラミングチュートリアル p.12 (Diagonal Winning Algo - Python 3 Programming Tutorial p.12)

eliminate

pattern

basically

spot